↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN604-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 : n014.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:25:42 PM UTC 2026

% Result   : Unsatisfiable 0.25s 0.57s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   44 (  19 unt;   2 nHn;  27 RR)
%            Number of literals    :   84 (   0 equ;  42 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-2 aty)
%            Number of variables   :   71 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p3_21,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_21) ).

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

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

cnf(p3_8,negated_conjecture,
    p3(f12(f10(X1)),f10(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_8) ).

cnf(p3_7,negated_conjecture,
    p3(f4(f8(X1)),f12(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_7) ).

cnf(p16_23,negated_conjecture,
    ( ~ p16(X3,X2)
    | ~ p16(X1,X3)
    | p16(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_23) ).

cnf(p16_30,negated_conjecture,
    ( ~ p16(c19,f4(X1))
    | p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_30) ).

cnf(p16_9,negated_conjecture,
    p16(f10(f11(c21)),f12(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_9) ).

cnf(p16_29,negated_conjecture,
    ( ~ p16(f4(X1),f12(c19))
    | p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_29) ).

cnf(not_p16_28,negated_conjecture,
    ~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p16_28) ).

cnf(p16_10,negated_conjecture,
    ( p16(X2,f12(X1))
    | p16(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_10) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_21]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    c_0_11 ).

cnf(c_0_13,negated_conjecture,
    p3(X1,X1),
    p3_4 ).

cnf(c_0_14,negated_conjecture,
    ( ~ p16(X3,X4)
    | ~ p3(X4,X2)
    | ~ p3(X3,X1)
    | p16(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p16_25]) ).

cnf(c_0_15,negated_conjecture,
    p3(f12(f10(X1)),f10(X1)),
    p3_8 ).

cnf(c_0_16,negated_conjecture,
    ( ~ p3(X2,X1)
    | p3(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    p3(f4(f8(X1)),f12(X1)),
    p3_7 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p16(X3,X4)
    | ~ p3(X4,X2)
    | ~ p3(X3,X1)
    | p16(X1,X2) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p3(f12(f10(X2)),X1)
    | p3(X1,f10(X2)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    p3(f12(X1),f4(f8(X1))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p16(X3,X2)
    | ~ p16(X1,X3)
    | p16(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p16_23]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p16(c19,f4(X1))
    | p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1))) ),
    inference(fof_simplification,[status(thm)],[p16_30]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p3(X3,X1)
    | ~ p16(X3,f12(f10(X2)))
    | p16(X1,f10(X2)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    p16(f10(f11(c21)),f12(X1)),
    p16_9 ).

cnf(c_0_25,negated_conjecture,
    p3(f4(f8(f10(X1))),f10(X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p16(X3,X2)
    | ~ p16(X1,X3)
    | p16(X1,X2) ),
    c_0_21 ).

cnf(c_0_27,negated_conjecture,
    ( ~ p16(c19,f4(X1))
    | p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1))) ),
    c_0_22 ).

cnf(c_0_28,negated_conjecture,
    ( ~ p16(f4(X1),f12(c19))
    | p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1))) ),
    inference(fof_simplification,[status(thm)],[p16_29]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ p3(f10(f11(c21)),X1)
    | p16(X1,f10(X2)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    p3(f10(X1),f4(f8(f10(X1)))),
    inference(spm,[status(thm)],[c_0_16,c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    ~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
    inference(fof_simplification,[status(thm)],[not_p16_28]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ p16(c19,f4(X2))
    | ~ p16(X1,f4(f6(f7(c20,c18),f8(f10(f11(c21))))))
    | p16(X1,f4(f6(f7(c20,c18),X2))) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p16(f4(X1),f12(c19))
    | p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1))) ),
    c_0_28 ).

cnf(c_0_34,negated_conjecture,
    ( ~ p16(X1,f10(f11(c21)))
    | p16(X1,f12(X2)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_35,negated_conjecture,
    p16(f4(f8(f10(f11(c21)))),f10(X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
    c_0_31 ).

cnf(c_0_37,negated_conjecture,
    ( ~ p16(c19,f4(X1))
    | ~ p16(f4(f8(f10(f11(c21)))),f12(c19))
    | p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1))) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    p16(f4(f8(f10(f11(c21)))),f12(X1)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ~ p16(f4(f13(c23)),f12(c19)),
    inference(spm,[status(thm)],[c_0_36,c_0_33]) ).

cnf(c_0_40,negated_conjecture,
    ( p16(X2,f12(X1))
    | p16(X1,X2) ),
    p16_10 ).

cnf(c_0_41,negated_conjecture,
    ( ~ p16(c19,f4(X1))
    | p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).

cnf(c_0_42,negated_conjecture,
    p16(c19,f4(f13(c23))),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN604-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n014.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 11:09:49 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.50  Running first-order theorem proving
% 0.25/0.50  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.25/0.57  % Version: 3.5.1
% 0.25/0.57  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.57  % Starting sh5l with 300s (1) cores
% 0.25/0.57  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3918368 completed with status 0
% 0.25/0.57  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.25/0.57  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.57  % No SInE strategy applied
% 0.25/0.57  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.25/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.57  % Starting new_bool_3 with 136s (1) cores
% 0.25/0.57  % Starting new_bool_1 with 136s (1) cores
% 0.25/0.57  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3918374 completed with status 0
% 0.25/0.57  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.25/0.57  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.57  % No SInE strategy applied
% 0.25/0.57  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.25/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.57  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.57  % Preprocessing time       : 0.001 s
% 0.25/0.57  % Presaturation interreduction done
% 0.25/0.57  
% 0.25/0.57  % Proof found!
% 0.25/0.57  % SZS status Unsatisfiable
% 0.25/0.57  % SZS output start CNFRefutation
% See solution above
% 0.25/0.57  % Parsed axioms                        : 30
% 0.25/0.57  % Removed by relevancy pruning/SinE    : 0
% 0.25/0.57  % Initial clauses                      : 30
% 0.25/0.57  % Removed in clause preprocessing      : 0
% 0.25/0.57  % Initial clauses in saturation        : 30
% 0.25/0.57  % Processed clauses                    : 281
% 0.25/0.57  % ...of these trivial                  : 0
% 0.25/0.57  % ...subsumed                          : 61
% 0.25/0.57  % ...remaining for further processing  : 220
% 0.25/0.57  % Other redundant clauses eliminated   : 0
% 0.25/0.57  % Clauses deleted for lack of memory   : 0
% 0.25/0.57  % Backward-subsumed                    : 0
% 0.25/0.57  % Backward-rewritten                   : 3
% 0.25/0.57  % Generated clauses                    : 1122
% 0.25/0.57  % ...of the previous two non-redundant : 905
% 0.25/0.57  % ...aggressively subsumed             : 0
% 0.25/0.57  % Contextual simplify-reflections      : 0
% 0.25/0.57  % Paramodulations                      : 1122
% 0.25/0.57  % Factorizations                       : 0
% 0.25/0.57  % NegExts                              : 0
% 0.25/0.57  % Equation resolutions                 : 0
% 0.25/0.57  % Disequality decompositions           : 0
% 0.25/0.57  % Total rewrite steps                  : 223
% 0.25/0.57  % ...of those cached                   : 199
% 0.25/0.57  % Propositional unsat checks           : 0
% 0.25/0.57  %    Propositional check models        : 0
% 0.25/0.57  %    Propositional check unsatisfiable : 0
% 0.25/0.57  %    Propositional clauses             : 0
% 0.25/0.57  %    Propositional clauses after purity: 0
% 0.25/0.57  %    Propositional unsat core size     : 0
% 0.25/0.57  %    Propositional preprocessing time  : 0.000
% 0.25/0.57  %    Propositional encoding time       : 0.000
% 0.25/0.57  %    Propositional solver time         : 0.000
% 0.25/0.57  %    Success case prop preproc time    : 0.000
% 0.25/0.57  %    Success case prop encoding time   : 0.000
% 0.25/0.57  %    Success case prop solver time     : 0.000
% 0.25/0.57  % Current number of processed clauses  : 187
% 0.25/0.57  %    Positive orientable unit clauses  : 21
% 0.25/0.57  %    Positive unorientable unit clauses: 0
% 0.25/0.57  %    Negative unit clauses             : 3
% 0.25/0.57  %    Non-unit-clauses                  : 163
% 0.25/0.57  % Current number of unprocessed clauses: 669
% 0.25/0.57  % ...number of literals in the above   : 2398
% 0.25/0.57  % Current number of archived formulas  : 0
% 0.25/0.57  % Current number of archived clauses   : 33
% 0.25/0.57  % Clause-clause subsumption calls (NU) : 6631
% 0.25/0.57  % Rec. Clause-clause subsumption calls : 5493
% 0.25/0.57  % Non-unit clause-clause subsumptions  : 61
% 0.25/0.57  % Unit Clause-clause subsumption calls : 168
% 0.25/0.57  % Rewrite failures with RHS unbound    : 0
% 0.25/0.57  % BW rewrite match attempts            : 2
% 0.25/0.57  % BW rewrite match successes           : 2
% 0.25/0.57  % Condensation attempts                : 0
% 0.25/0.57  % Condensation successes               : 0
% 0.25/0.57  % Termbank termtop insertions          : 23741
% 0.25/0.57  % Search garbage collected termcells   : 79
% 0.25/0.57  
% 0.25/0.57  % -------------------------------------------------
% 0.25/0.57  % User time                : 0.027 s
% 0.25/0.57  % System time              : 0.008 s
% 0.25/0.57  % Total time               : 0.035 s
% 0.25/0.57  % Maximum resident set size: 3664 pages
% 0.25/0.57  
% 0.25/0.57  % -------------------------------------------------
% 0.25/0.57  % User time                : 0.121 s
% 0.25/0.57  % System time              : 0.032 s
% 0.25/0.57  % Total time               : 0.152 s
% 0.25/0.57  % Maximum resident set size: 4608 pages
% 0.25/0.57  % E exiting
%------------------------------------------------------------------------------