↑ 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  : SYN592-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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 03:35:19 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.46s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   36 (  17 unt;   6 nHn;  29 RR)
%            Number of literals    :   71 (   0 equ;  35 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p11_27,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p11(c13,f4(f6(X1),c17))
    | p11(c13,f4(c17,f6(X1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_27) ).

cnf(p3_26,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_26) ).

cnf(p2_22,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p2(f6(X1),f5(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_22) ).

cnf(p11_25,negated_conjecture,
    ( ~ p11(X4,X3)
    | ~ p7(X4,X1)
    | ~ p3(X3,X2)
    | p11(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_25) ).

cnf(p12_11,negated_conjecture,
    p12(c14,f4(c18,c17)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_11) ).

cnf(p2_4,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

cnf(not_p11_13,negated_conjecture,
    ~ p11(c13,f4(f5(c18),c17)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_13) ).

cnf(p7_3,negated_conjecture,
    p7(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_3) ).

cnf(not_p11_12,negated_conjecture,
    ~ p11(c13,f4(c17,f5(c18))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_12) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p11(c13,f4(f6(X1),c17))
    | p11(c13,f4(c17,f6(X1))) ),
    inference(fof_simplification,[status(thm)],[p11_27]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p3_26]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p2(f6(X1),f5(X1)) ),
    inference(fof_simplification,[status(thm)],[p2_22]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p11(X4,X3)
    | ~ p7(X4,X1)
    | ~ p3(X3,X2)
    | p11(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p11_25]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p11(c13,f4(f6(X1),c17))
    | p11(c13,f4(c17,f6(X1))) ),
    c_0_9 ).

cnf(c_0_14,negated_conjecture,
    p12(c14,f4(c18,c17)),
    p12_11 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X4)) ),
    c_0_10 ).

cnf(c_0_16,negated_conjecture,
    p2(X1,X1),
    p2_4 ).

cnf(c_0_17,negated_conjecture,
    ( ~ p12(c14,f4(X1,c17))
    | p2(f6(X1),f5(X1)) ),
    c_0_11 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p11(X4,X3)
    | ~ p7(X4,X1)
    | ~ p3(X3,X2)
    | p11(X1,X2) ),
    c_0_12 ).

cnf(c_0_19,negated_conjecture,
    ( p11(c13,f4(c17,f6(c18)))
    | p11(c13,f4(f6(c18),c17)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    p2(f6(c18),f5(c18)),
    inference(spm,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p7(c13,X1)
    | ~ p3(f4(f6(c18),c17),X2)
    | p11(X1,X2)
    | p11(c13,f4(c17,f6(c18))) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    p3(f4(f6(c18),X1),f4(f5(c18),X1)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ~ p11(c13,f4(f5(c18),c17)),
    inference(fof_simplification,[status(thm)],[not_p11_13]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p7(c13,X1)
    | p11(X1,f4(f5(c18),c17))
    | p11(c13,f4(c17,f6(c18))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    p7(X1,X1),
    p7_3 ).

cnf(c_0_27,negated_conjecture,
    ~ p11(c13,f4(f5(c18),c17)),
    c_0_24 ).

cnf(c_0_28,negated_conjecture,
    p11(c13,f4(c17,f6(c18))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1,f6(c18)),f4(X2,f5(c18))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p7(c13,X1)
    | ~ p3(f4(c17,f6(c18)),X2)
    | p11(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    p3(f4(X1,f6(c18)),f4(X1,f5(c18))),
    inference(spm,[status(thm)],[c_0_29,c_0_16]) ).

cnf(c_0_32,negated_conjecture,
    ~ p11(c13,f4(c17,f5(c18))),
    inference(fof_simplification,[status(thm)],[not_p11_12]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p7(c13,X1)
    | p11(X1,f4(c17,f5(c18))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    ~ p11(c13,f4(c17,f5(c18))),
    c_0_32 ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN592-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 11:09:35 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46  % Version: 3.5.1
% 0.15/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46  % Starting sh5l with 300s (1) cores
% 0.15/0.46  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2992546 completed with status 0
% 0.15/0.46  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46  % No SInE strategy applied
% 0.15/0.46  % Search class: FGUNM-FFSM21-SFFFFFNN
% 0.15/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46  % new_bool_1 with pid 2992556 completed with status 0
% 0.15/0.46  % Result found by new_bool_1
% 0.15/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46  % No SInE strategy applied
% 0.15/0.46  % Search class: FGUNM-FFSM21-SFFFFFNN
% 0.15/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46  % Preprocessing time       : 0.001 s
% 0.15/0.46  % Presaturation interreduction done
% 0.15/0.46  
% 0.15/0.46  % Proof found!
% 0.15/0.46  % SZS status Unsatisfiable
% 0.15/0.46  % SZS output start CNFRefutation
% See solution above
% 0.15/0.46  % Parsed axioms                        : 27
% 0.15/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.46  % Initial clauses                      : 27
% 0.15/0.46  % Removed in clause preprocessing      : 0
% 0.15/0.46  % Initial clauses in saturation        : 27
% 0.15/0.46  % Processed clauses                    : 381
% 0.15/0.46  % ...of these trivial                  : 72
% 0.15/0.46  % ...subsumed                          : 1
% 0.15/0.46  % ...remaining for further processing  : 308
% 0.15/0.46  % Other redundant clauses eliminated   : 0
% 0.15/0.46  % Clauses deleted for lack of memory   : 0
% 0.15/0.46  % Backward-subsumed                    : 0
% 0.15/0.46  % Backward-rewritten                   : 5
% 0.15/0.46  % Generated clauses                    : 2083
% 0.15/0.46  % ...of the previous two non-redundant : 1716
% 0.15/0.46  % ...aggressively subsumed             : 0
% 0.15/0.46  % Contextual simplify-reflections      : 0
% 0.15/0.46  % Paramodulations                      : 2083
% 0.15/0.46  % Factorizations                       : 0
% 0.15/0.46  % NegExts                              : 0
% 0.15/0.46  % Equation resolutions                 : 0
% 0.15/0.46  % Disequality decompositions           : 0
% 0.15/0.46  % Total rewrite steps                  : 441
% 0.15/0.46  % ...of those cached                   : 180
% 0.15/0.46  % Propositional unsat checks           : 0
% 0.15/0.46  %    Propositional check models        : 0
% 0.15/0.46  %    Propositional check unsatisfiable : 0
% 0.15/0.46  %    Propositional clauses             : 0
% 0.15/0.46  %    Propositional clauses after purity: 0
% 0.15/0.46  %    Propositional unsat core size     : 0
% 0.15/0.46  %    Propositional preprocessing time  : 0.000
% 0.15/0.46  %    Propositional encoding time       : 0.000
% 0.15/0.46  %    Propositional solver time         : 0.000
% 0.15/0.46  %    Success case prop preproc time    : 0.000
% 0.15/0.46  %    Success case prop encoding time   : 0.000
% 0.15/0.46  %    Success case prop solver time     : 0.000
% 0.15/0.46  % Current number of processed clauses  : 276
% 0.15/0.46  %    Positive orientable unit clauses  : 120
% 0.15/0.46  %    Positive unorientable unit clauses: 0
% 0.15/0.46  %    Negative unit clauses             : 3
% 0.15/0.46  %    Non-unit-clauses                  : 153
% 0.15/0.46  % Current number of unprocessed clauses: 1388
% 0.15/0.46  % ...number of literals in the above   : 1439
% 0.15/0.46  % Current number of archived formulas  : 0
% 0.15/0.46  % Current number of archived clauses   : 32
% 0.15/0.46  % Clause-clause subsumption calls (NU) : 2077
% 0.15/0.46  % Rec. Clause-clause subsumption calls : 1984
% 0.15/0.46  % Non-unit clause-clause subsumptions  : 1
% 0.15/0.46  % Unit Clause-clause subsumption calls : 127
% 0.15/0.46  % Rewrite failures with RHS unbound    : 0
% 0.15/0.46  % BW rewrite match attempts            : 496
% 0.15/0.46  % BW rewrite match successes           : 2
% 0.15/0.46  % Condensation attempts                : 0
% 0.15/0.46  % Condensation successes               : 0
% 0.15/0.46  % Termbank termtop insertions          : 45234
% 0.15/0.46  % Search garbage collected termcells   : 67
% 0.15/0.46  
% 0.15/0.46  % -------------------------------------------------
% 0.15/0.46  % User time                : 0.034 s
% 0.15/0.46  % System time              : 0.007 s
% 0.15/0.46  % Total time               : 0.040 s
% 0.15/0.46  % Maximum resident set size: 3652 pages
% 0.15/0.46  
% 0.15/0.46  % -------------------------------------------------
% 0.15/0.46  % User time                : 0.175 s
% 0.15/0.46  % System time              : 0.027 s
% 0.15/0.46  % Total time               : 0.202 s
% 0.15/0.46  % Maximum resident set size: 4864 pages
% 0.15/0.46  % E exiting
%------------------------------------------------------------------------------