↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n005.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:49 PM UTC 2026

% Result   : Unsatisfiable 0.54s 0.51s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  14 unt;   8 nHn;  25 RR)
%            Number of literals    :   66 (   0 equ;  27 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-3 aty)
%            Number of variables   :   56 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p24_45,negated_conjecture,
    ( ~ p25(X1,f18(f8(c27,f9(c28,c29))))
    | p24(f19(f20(c34,c31)),f19(f20(c34,X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p24_45) ).

cnf(p6_25,negated_conjecture,
    ( ~ p6(X3,X2)
    | ~ p6(X3,X1)
    | p6(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_25) ).

cnf(p6_49,negated_conjecture,
    ( ~ p24(f19(f20(X2,X3)),f19(f20(X2,f22(X1,X2,X3))))
    | p4(f5(X1,c36,X2),f5(X1,c36,X3))
    | p6(f21(X1),f10(c33)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_49) ).

cnf(p6_48,negated_conjecture,
    ( p4(f5(X1,c36,X2),f5(X1,c36,X3))
    | p25(f22(X1,X2,X3),f18(X1))
    | p6(f21(X1),f10(c33)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_48) ).

cnf(p6_15,negated_conjecture,
    p6(f21(f8(X1,f9(X2,X3))),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_15) ).

cnf(p4_26,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_26) ).

cnf(p6_3,negated_conjecture,
    p6(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_3) ).

cnf(not_p6_11,negated_conjecture,
    ~ p6(c28,f10(c33)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p6_11) ).

cnf(p4_4,negated_conjecture,
    p4(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_4) ).

cnf(not_p4_44,negated_conjecture,
    ~ p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p4_44) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p25(X1,f18(f8(c27,f9(c28,c29))))
    | p24(f19(f20(c34,c31)),f19(f20(c34,X1))) ),
    inference(fof_simplification,[status(thm)],[p24_45]) ).

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

cnf(c_0_12,negated_conjecture,
    ( ~ p24(f19(f20(X2,X3)),f19(f20(X2,f22(X1,X2,X3))))
    | p4(f5(X1,c36,X2),f5(X1,c36,X3))
    | p6(f21(X1),f10(c33)) ),
    inference(fof_simplification,[status(thm)],[p6_49]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p25(X1,f18(f8(c27,f9(c28,c29))))
    | p24(f19(f20(c34,c31)),f19(f20(c34,X1))) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    ( p4(f5(X1,c36,X2),f5(X1,c36,X3))
    | p25(f22(X1,X2,X3),f18(X1))
    | p6(f21(X1),f10(c33)) ),
    p6_48 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p6(X3,X2)
    | ~ p6(X3,X1)
    | p6(X1,X2) ),
    c_0_11 ).

cnf(c_0_16,negated_conjecture,
    p6(f21(f8(X1,f9(X2,X3))),X2),
    p6_15 ).

cnf(c_0_17,negated_conjecture,
    ( ~ p24(f19(f20(X2,X3)),f19(f20(X2,f22(X1,X2,X3))))
    | p4(f5(X1,c36,X2),f5(X1,c36,X3))
    | p6(f21(X1),f10(c33)) ),
    c_0_12 ).

cnf(c_0_18,negated_conjecture,
    ( p6(f21(f8(c27,f9(c28,c29))),f10(c33))
    | p4(f5(f8(c27,f9(c28,c29)),c36,X1),f5(f8(c27,f9(c28,c29)),c36,X2))
    | p24(f19(f20(c34,c31)),f19(f20(c34,f22(f8(c27,f9(c28,c29)),X1,X2)))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p4_26]) ).

cnf(c_0_20,negated_conjecture,
    p6(X1,X1),
    p6_3 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p6(f21(f8(X3,f9(X2,X4))),X1)
    | p6(X1,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    ( p6(f21(f8(c27,f9(c28,c29))),f10(c33))
    | p4(f5(f8(c27,f9(c28,c29)),c36,c34),f5(f8(c27,f9(c28,c29)),c36,c31)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ~ p6(c28,f10(c33)),
    inference(fof_simplification,[status(thm)],[not_p6_11]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    c_0_19 ).

cnf(c_0_25,negated_conjecture,
    p4(X1,X1),
    p4_4 ).

cnf(c_0_26,negated_conjecture,
    ( ~ p6(X2,X1)
    | p6(X1,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    ( p6(f10(c33),c28)
    | p4(f5(f8(c27,f9(c28,c29)),c36,c34),f5(f8(c27,f9(c28,c29)),c36,c31)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ~ p6(c28,f10(c33)),
    c_0_23 ).

cnf(c_0_29,negated_conjecture,
    ~ p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)),
    inference(fof_simplification,[status(thm)],[not_p4_44]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p4(X2,X1)
    | p4(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    p4(f5(f8(c27,f9(c28,c29)),c36,c34),f5(f8(c27,f9(c28,c29)),c36,c31)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ~ p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)),
    c_0_29 ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN658-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n005.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 11:11:02 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  Running first-order theorem proving
% 0.15/0.42  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.54/0.51  % Version: 3.5.1
% 0.54/0.51  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.54/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.54/0.51  % Starting new_bool_3 with 300s (1) cores
% 0.54/0.51  % Starting new_bool_1 with 300s (1) cores
% 0.54/0.51  % Starting sh5l with 300s (1) cores
% 0.54/0.51  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3321679 completed with status 0
% 0.54/0.51  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.54/0.51  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.54/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.54/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.51  % No SInE strategy applied
% 0.54/0.51  % Search class: FGHNM-FFMM31-DFFFFFNN
% 0.54/0.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.51  % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.54/0.51  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.51  % Starting new_bool_3 with 136s (1) cores
% 0.54/0.51  % Starting new_bool_1 with 136s (1) cores
% 0.54/0.51  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3321685 completed with status 0
% 0.54/0.51  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.54/0.51  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.54/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.54/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.51  % No SInE strategy applied
% 0.54/0.51  % Search class: FGHNM-FFMM31-DFFFFFNN
% 0.54/0.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.51  % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.54/0.51  % Preprocessing time       : 0.002 s
% 0.54/0.51  % Presaturation interreduction done
% 0.54/0.51  
% 0.54/0.51  % Proof found!
% 0.54/0.51  % SZS status Unsatisfiable
% 0.54/0.51  % SZS output start CNFRefutation
% See solution above
% 0.54/0.51  % Parsed axioms                        : 50
% 0.54/0.51  % Removed by relevancy pruning/SinE    : 0
% 0.54/0.51  % Initial clauses                      : 50
% 0.54/0.51  % Removed in clause preprocessing      : 0
% 0.54/0.51  % Initial clauses in saturation        : 50
% 0.54/0.51  % Processed clauses                    : 426
% 0.54/0.51  % ...of these trivial                  : 33
% 0.54/0.51  % ...subsumed                          : 0
% 0.54/0.51  % ...remaining for further processing  : 393
% 0.54/0.51  % Other redundant clauses eliminated   : 0
% 0.54/0.51  % Clauses deleted for lack of memory   : 0
% 0.54/0.51  % Backward-subsumed                    : 0
% 0.54/0.51  % Backward-rewritten                   : 2
% 0.54/0.51  % Generated clauses                    : 3179
% 0.54/0.51  % ...of the previous two non-redundant : 3013
% 0.54/0.51  % ...aggressively subsumed             : 0
% 0.54/0.51  % Contextual simplify-reflections      : 0
% 0.54/0.51  % Paramodulations                      : 3179
% 0.54/0.51  % Factorizations                       : 0
% 0.54/0.51  % NegExts                              : 0
% 0.54/0.51  % Equation resolutions                 : 0
% 0.54/0.51  % Disequality decompositions           : 0
% 0.54/0.51  % Total rewrite steps                  : 193
% 0.54/0.51  % ...of those cached                   : 42
% 0.54/0.51  % Propositional unsat checks           : 0
% 0.54/0.51  %    Propositional check models        : 0
% 0.54/0.51  %    Propositional check unsatisfiable : 0
% 0.54/0.51  %    Propositional clauses             : 0
% 0.54/0.51  %    Propositional clauses after purity: 0
% 0.54/0.51  %    Propositional unsat core size     : 0
% 0.54/0.51  %    Propositional preprocessing time  : 0.000
% 0.54/0.51  %    Propositional encoding time       : 0.000
% 0.54/0.51  %    Propositional solver time         : 0.000
% 0.54/0.51  %    Success case prop preproc time    : 0.000
% 0.54/0.51  %    Success case prop encoding time   : 0.000
% 0.54/0.51  %    Success case prop solver time     : 0.000
% 0.54/0.51  % Current number of processed clauses  : 341
% 0.54/0.51  %    Positive orientable unit clauses  : 125
% 0.54/0.51  %    Positive unorientable unit clauses: 0
% 0.54/0.51  %    Negative unit clauses             : 2
% 0.54/0.51  %    Non-unit-clauses                  : 214
% 0.54/0.51  % Current number of unprocessed clauses: 2661
% 0.54/0.51  % ...number of literals in the above   : 3770
% 0.54/0.51  % Current number of archived formulas  : 0
% 0.54/0.51  % Current number of archived clauses   : 52
% 0.54/0.51  % Clause-clause subsumption calls (NU) : 5990
% 0.54/0.51  % Rec. Clause-clause subsumption calls : 5413
% 0.54/0.51  % Non-unit clause-clause subsumptions  : 0
% 0.54/0.51  % Unit Clause-clause subsumption calls : 87
% 0.54/0.51  % Rewrite failures with RHS unbound    : 0
% 0.54/0.51  % BW rewrite match attempts            : 736
% 0.54/0.51  % BW rewrite match successes           : 1
% 0.54/0.51  % Condensation attempts                : 0
% 0.54/0.51  % Condensation successes               : 0
% 0.54/0.51  % Termbank termtop insertions          : 86670
% 0.54/0.51  % Search garbage collected termcells   : 127
% 0.54/0.51  
% 0.54/0.51  % -------------------------------------------------
% 0.54/0.51  % User time                : 0.063 s
% 0.54/0.51  % System time              : 0.011 s
% 0.54/0.51  % Total time               : 0.074 s
% 0.54/0.51  % Maximum resident set size: 3688 pages
% 0.54/0.51  
% 0.54/0.51  % -------------------------------------------------
% 0.54/0.51  % User time                : 0.324 s
% 0.54/0.51  % System time              : 0.043 s
% 0.54/0.51  % Total time               : 0.367 s
% 0.54/0.51  % Maximum resident set size: 4608 pages
% 0.54/0.51  % E exiting
%------------------------------------------------------------------------------