↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN565-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 : n002.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:37 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.48s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   41 (  21 unt;   0 nHn;  23 RR)
%            Number of literals    :   74 (   0 equ;  36 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   93 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p2_8,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_8) ).

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

cnf(p2_3,negated_conjecture,
    p2(f5(f7(X1)),f5(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_3) ).

cnf(p4_5,negated_conjecture,
    p4(f7(f8(X1,X2)),f8(X2,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_5) ).

cnf(p10_13,negated_conjecture,
    ( ~ p10(X1,f3(X3,X2))
    | p10(f9(X1,X2),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_13) ).

cnf(p10_14,negated_conjecture,
    ( ~ p10(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p10(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_14) ).

cnf(p10_10,negated_conjecture,
    p10(f5(X1),f3(f5(f6(X1,X2)),f5(X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_10) ).

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

cnf(p2_17,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p2(f9(X1,X2),f9(X3,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_17) ).

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

cnf(not_p10_11,negated_conjecture,
    ~ p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p10_11) ).

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

cnf(c_0_12,negated_conjecture,
    ( ~ p4(X1,X2)
    | p2(f5(X1),f5(X2)) ),
    inference(fof_simplification,[status(thm)],[p2_6]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_11 ).

cnf(c_0_14,negated_conjecture,
    p2(f5(f7(X1)),f5(X1)),
    p2_3 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p4(X1,X2)
    | p2(f5(X1),f5(X2)) ),
    c_0_12 ).

cnf(c_0_16,negated_conjecture,
    p4(f7(f8(X1,X2)),f8(X2,X1)),
    p4_5 ).

cnf(c_0_17,negated_conjecture,
    ( ~ p10(X1,f3(X3,X2))
    | p10(f9(X1,X2),X3) ),
    inference(fof_simplification,[status(thm)],[p10_13]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p2(f5(f7(X2)),X1)
    | p2(X1,f5(X2)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    p2(f5(f7(f8(X1,X2))),f5(f8(X2,X1))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p10(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p10(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p10_14]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p10(X1,f3(X3,X2))
    | p10(f9(X1,X2),X3) ),
    c_0_17 ).

cnf(c_0_22,negated_conjecture,
    p10(f5(X1),f3(f5(f6(X1,X2)),f5(X2))),
    p10_10 ).

cnf(c_0_23,negated_conjecture,
    p2(f5(f8(X1,X2)),f5(f8(X2,X1))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    p4(f8(X1,X2),f6(X1,f7(X2))),
    p4_4 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p2(f9(X1,X2),f9(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p2_17]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p10(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p10(X1,X2) ),
    c_0_20 ).

cnf(c_0_27,negated_conjecture,
    p10(f9(f5(X1),f5(X2)),f5(f6(X1,X2))),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p2(f5(f8(X3,X2)),X1)
    | p2(X1,f5(f8(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    p2(f5(f8(X1,X2)),f5(f6(X1,f7(X2)))),
    inference(spm,[status(thm)],[c_0_15,c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p2(f9(X1,X2),f9(X3,X4)) ),
    c_0_25 ).

cnf(c_0_31,negated_conjecture,
    ( ~ p2(f5(f6(X3,X4)),X2)
    | ~ p2(f9(f5(X3),f5(X4)),X1)
    | p10(X1,X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    p2(f5(f6(X1,f7(X2))),f5(f8(X2,X1))),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p2(X1,X3)
    | p2(f9(X1,f5(f7(X2))),f9(X3,f5(X2))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_14]) ).

cnf(c_0_34,negated_conjecture,
    p2(X1,X1),
    p2_1 ).

cnf(c_0_35,negated_conjecture,
    ~ p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11))),
    inference(fof_simplification,[status(thm)],[not_p10_11]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ p2(f9(f5(X3),f5(f7(X2))),X1)
    | p10(X1,f5(f8(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    p2(f9(X1,f5(f7(X2))),f9(X1,f5(X2))),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    ~ p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11))),
    c_0_35 ).

cnf(c_0_39,negated_conjecture,
    p10(f9(f5(X1),f5(X2)),f5(f8(X2,X1))),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN565-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.11/0.37  % Computer : n002.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 11:11:17 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.11/0.48  % Version: 3.5.1
% 0.11/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.48  % Starting sh5l with 300s (1) cores
% 0.11/0.48  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3144398 completed with status 0
% 0.11/0.48  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.48  % No SInE strategy applied
% 0.11/0.48  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.48  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.11/0.48  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.48  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.48  % new_bool_3 with pid 3144408 completed with status 0
% 0.11/0.48  % Result found by new_bool_3
% 0.11/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.48  % No SInE strategy applied
% 0.11/0.48  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.48  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.11/0.48  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.48  % Preprocessing time       : 0.001 s
% 0.11/0.48  % Presaturation interreduction done
% 0.11/0.48  
% 0.11/0.48  % Proof found!
% 0.11/0.48  % SZS status Unsatisfiable
% 0.11/0.48  % SZS output start CNFRefutation
% See solution above
% 0.11/0.48  % Parsed axioms                        : 18
% 0.11/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.48  % Initial clauses                      : 18
% 0.11/0.48  % Removed in clause preprocessing      : 0
% 0.11/0.48  % Initial clauses in saturation        : 18
% 0.11/0.48  % Processed clauses                    : 315
% 0.11/0.48  % ...of these trivial                  : 89
% 0.11/0.48  % ...subsumed                          : 0
% 0.11/0.48  % ...remaining for further processing  : 226
% 0.11/0.48  % Other redundant clauses eliminated   : 0
% 0.11/0.48  % Clauses deleted for lack of memory   : 0
% 0.11/0.48  % Backward-subsumed                    : 0
% 0.11/0.48  % Backward-rewritten                   : 1
% 0.11/0.48  % Generated clauses                    : 3006
% 0.11/0.48  % ...of the previous two non-redundant : 2456
% 0.11/0.48  % ...aggressively subsumed             : 0
% 0.11/0.48  % Contextual simplify-reflections      : 0
% 0.11/0.48  % Paramodulations                      : 3006
% 0.11/0.48  % Factorizations                       : 0
% 0.11/0.48  % NegExts                              : 0
% 0.11/0.48  % Equation resolutions                 : 0
% 0.11/0.48  % Disequality decompositions           : 0
% 0.11/0.48  % Total rewrite steps                  : 638
% 0.11/0.48  % ...of those cached                   : 394
% 0.11/0.48  % Propositional unsat checks           : 0
% 0.11/0.48  %    Propositional check models        : 0
% 0.11/0.48  %    Propositional check unsatisfiable : 0
% 0.11/0.48  %    Propositional clauses             : 0
% 0.11/0.48  %    Propositional clauses after purity: 0
% 0.11/0.48  %    Propositional unsat core size     : 0
% 0.11/0.48  %    Propositional preprocessing time  : 0.000
% 0.11/0.48  %    Propositional encoding time       : 0.000
% 0.11/0.48  %    Propositional solver time         : 0.000
% 0.11/0.48  %    Success case prop preproc time    : 0.000
% 0.11/0.48  %    Success case prop encoding time   : 0.000
% 0.11/0.48  %    Success case prop solver time     : 0.000
% 0.11/0.48  % Current number of processed clauses  : 207
% 0.11/0.48  %    Positive orientable unit clauses  : 67
% 0.11/0.48  %    Positive unorientable unit clauses: 0
% 0.11/0.48  %    Negative unit clauses             : 0
% 0.11/0.48  %    Non-unit-clauses                  : 140
% 0.11/0.48  % Current number of unprocessed clauses: 2177
% 0.11/0.48  % ...number of literals in the above   : 2295
% 0.11/0.48  % Current number of archived formulas  : 0
% 0.11/0.48  % Current number of archived clauses   : 19
% 0.11/0.48  % Clause-clause subsumption calls (NU) : 1532
% 0.11/0.48  % Rec. Clause-clause subsumption calls : 1214
% 0.11/0.48  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.48  % Unit Clause-clause subsumption calls : 45
% 0.11/0.48  % Rewrite failures with RHS unbound    : 0
% 0.11/0.48  % BW rewrite match attempts            : 237
% 0.11/0.48  % BW rewrite match successes           : 1
% 0.11/0.48  % Condensation attempts                : 0
% 0.11/0.48  % Condensation successes               : 0
% 0.11/0.48  % Termbank termtop insertions          : 52162
% 0.11/0.48  % Search garbage collected termcells   : 46
% 0.11/0.48  
% 0.11/0.48  % -------------------------------------------------
% 0.11/0.48  % User time                : 0.041 s
% 0.11/0.48  % System time              : 0.005 s
% 0.11/0.48  % Total time               : 0.046 s
% 0.11/0.48  % Maximum resident set size: 3604 pages
% 0.11/0.48  
% 0.11/0.48  % -------------------------------------------------
% 0.11/0.48  % User time                : 0.200 s
% 0.11/0.48  % System time              : 0.030 s
% 0.11/0.48  % Total time               : 0.230 s
% 0.11/0.48  % Maximum resident set size: 4608 pages
% 0.11/0.48  % E exiting
%------------------------------------------------------------------------------