↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SET822-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:18:36 PM UTC 2026

% Result   : Unsatisfiable 0.64s 0.62s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (   9 unt;   0 nHn;  14 RR)
%            Number of literals    :   27 (   4 equ;  14 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
    ( ~ c_in(v_f(X1),X2,tc_IntDef_Oint)
    | c_in(v_x(X1,X2),X2,tc_IntDef_Oint) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    ( ~ v_P(v_x(X1,X2))
    | ~ c_in(v_f(X1),X2,tc_IntDef_Oint) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Set_OsingletonD__dest_0,axiom,
    ( ~ c_in(X1,c_insert(X2,c_emptyset,X3),X3)
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsingletonD__dest_0) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    v_P(v_f(v_b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_5,negated_conjecture,
    ( ~ c_in(v_f(X1),X2,tc_IntDef_Oint)
    | c_in(v_x(X1,X2),X2,tc_IntDef_Oint) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_6,negated_conjecture,
    ( ~ v_P(v_x(X1,X2))
    | ~ c_in(v_f(X1),X2,tc_IntDef_Oint) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

cnf(c_0_7,plain,
    ( ~ c_in(X1,c_insert(X2,c_emptyset,X3),X3)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsingletonD__dest_0]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ c_in(v_f(X1),X2,tc_IntDef_Oint)
    | c_in(v_x(X1,X2),X2,tc_IntDef_Oint) ),
    c_0_5 ).

cnf(c_0_9,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_10,negated_conjecture,
    ( ~ v_P(v_x(X1,X2))
    | ~ c_in(v_f(X1),X2,tc_IntDef_Oint) ),
    c_0_6 ).

cnf(c_0_11,plain,
    ( ~ c_in(X1,c_insert(X2,c_emptyset,X3),X3)
    | X1 = X2 ),
    c_0_7 ).

cnf(c_0_12,negated_conjecture,
    c_in(v_x(X1,c_insert(v_f(X1),X2,tc_IntDef_Oint)),c_insert(v_f(X1),X2,tc_IntDef_Oint),tc_IntDef_Oint),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ v_P(v_x(X1,c_insert(v_f(X1),X2,tc_IntDef_Oint))),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    v_x(X1,c_insert(v_f(X1),c_emptyset,tc_IntDef_Oint)) = v_f(X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    v_P(v_f(v_b)),
    cls_conjecture_0 ).

cnf(c_0_16,negated_conjecture,
    ~ v_P(v_f(X1)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET822-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n018.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 05:41:58 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.62  % Version: 3.5.1
% 0.64/0.62  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.62  % Starting new_bool_3 with 300s (1) cores
% 0.64/0.62  % Starting new_bool_1 with 300s (1) cores
% 0.64/0.62  % Starting sh5l with 300s (1) cores
% 0.64/0.62  % new_bool_3 with pid 1082947 completed with status 9
% 0.64/0.62  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1082946 completed with status 0
% 0.64/0.62  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.64/0.62  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.62  % No SInE strategy applied
% 0.64/0.62  % Search class: FGHSM-SSLM33-MFFFFFNN
% 0.64/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.64/0.62  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 0.64/0.62  % Starting new_bool_3 with 136s (1) cores
% 0.64/0.62  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.64/0.62  % G-E--_200_B02_F1_AE_CS_SP_PI_S2k with pid 1082956 completed with status 0
% 0.64/0.62  % Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S2k
% 0.64/0.62  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.64/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.62  % No SInE strategy applied
% 0.64/0.62  % Search class: FGHSM-SSLM33-MFFFFFNN
% 0.64/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.64/0.62  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 0.64/0.62  % Preprocessing time       : 0.011 s
% 0.64/0.62  
% 0.64/0.62  % Proof found!
% 0.64/0.62  % SZS status Unsatisfiable
% 0.64/0.62  % SZS output start CNFRefutation
% See solution above
% 0.64/0.62  % Parsed axioms                        : 1360
% 0.64/0.62  % Removed by relevancy pruning/SinE    : 0
% 0.64/0.62  % Initial clauses                      : 1360
% 0.64/0.62  % Removed in clause preprocessing      : 1
% 0.64/0.62  % Initial clauses in saturation        : 1359
% 0.64/0.62  % Processed clauses                    : 1947
% 0.64/0.62  % ...of these trivial                  : 10
% 0.64/0.62  % ...subsumed                          : 343
% 0.64/0.62  % ...remaining for further processing  : 1594
% 0.64/0.62  % Other redundant clauses eliminated   : 4
% 0.64/0.62  % Clauses deleted for lack of memory   : 0
% 0.64/0.62  % Backward-subsumed                    : 3
% 0.64/0.62  % Backward-rewritten                   : 29
% 0.64/0.62  % Generated clauses                    : 2956
% 0.64/0.62  % ...of the previous two non-redundant : 1819
% 0.64/0.62  % ...aggressively subsumed             : 0
% 0.64/0.62  % Contextual simplify-reflections      : 0
% 0.64/0.62  % Paramodulations                      : 2918
% 0.64/0.62  % Factorizations                       : 0
% 0.64/0.62  % NegExts                              : 0
% 0.64/0.62  % Equation resolutions                 : 37
% 0.64/0.62  % Disequality decompositions           : 0
% 0.64/0.62  % Total rewrite steps                  : 1325
% 0.64/0.62  % ...of those cached                   : 1066
% 0.64/0.62  % Propositional unsat checks           : 0
% 0.64/0.62  %    Propositional check models        : 0
% 0.64/0.62  %    Propositional check unsatisfiable : 0
% 0.64/0.62  %    Propositional clauses             : 0
% 0.64/0.62  %    Propositional clauses after purity: 0
% 0.64/0.62  %    Propositional unsat core size     : 0
% 0.64/0.62  %    Propositional preprocessing time  : 0.000
% 0.64/0.62  %    Propositional encoding time       : 0.000
% 0.64/0.62  %    Propositional solver time         : 0.000
% 0.64/0.62  %    Success case prop preproc time    : 0.000
% 0.64/0.62  %    Success case prop encoding time   : 0.000
% 0.64/0.62  %    Success case prop solver time     : 0.000
% 0.64/0.62  % Current number of processed clauses  : 1561
% 0.64/0.62  %    Positive orientable unit clauses  : 213
% 0.64/0.62  %    Positive unorientable unit clauses: 1
% 0.64/0.62  %    Negative unit clauses             : 100
% 0.64/0.62  %    Non-unit-clauses                  : 1247
% 0.64/0.62  % Current number of unprocessed clauses: 1204
% 0.64/0.62  % ...number of literals in the above   : 2039
% 0.64/0.62  % Current number of archived formulas  : 0
% 0.64/0.62  % Current number of archived clauses   : 33
% 0.64/0.62  % Clause-clause subsumption calls (NU) : 423628
% 0.64/0.62  % Rec. Clause-clause subsumption calls : 391011
% 0.64/0.62  % Non-unit clause-clause subsumptions  : 300
% 0.64/0.62  % Unit Clause-clause subsumption calls : 10614
% 0.64/0.62  % Rewrite failures with RHS unbound    : 0
% 0.64/0.62  % BW rewrite match attempts            : 107
% 0.64/0.62  % BW rewrite match successes           : 35
% 0.64/0.62  % Condensation attempts                : 0
% 0.64/0.62  % Condensation successes               : 0
% 0.64/0.62  % Termbank termtop insertions          : 65430
% 0.64/0.62  % Search garbage collected termcells   : 1593
% 0.64/0.62  
% 0.64/0.62  % -------------------------------------------------
% 0.64/0.62  % User time                : 0.173 s
% 0.64/0.62  % System time              : 0.015 s
% 0.64/0.62  % Total time               : 0.188 s
% 0.64/0.62  % Maximum resident set size: 5628 pages
% 0.64/0.62  
% 0.64/0.62  % -------------------------------------------------
% 0.64/0.62  % User time                : 0.863 s
% 0.64/0.62  % System time              : 0.075 s
% 0.64/0.62  % Total time               : 0.938 s
% 0.64/0.62  % Maximum resident set size: 5376 pages
% 0.64/0.62  % E exiting
%------------------------------------------------------------------------------