↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 2.09s 0.73s
% Output   : CNFRefutation 2.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  21 unt;   0 nHn;  32 RR)
%            Number of literals    :   63 (   0 equ;  32 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-1 aty)
%            Number of variables   :   35 (   0 sgn)

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

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

cnf(p2_33,negated_conjecture,
    p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_33) ).

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

cnf(p2_34,negated_conjecture,
    p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_34) ).

cnf(p19_12,negated_conjecture,
    p19(f13(f11(c23)),f13(f11(c22))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19_12) ).

cnf(p20_35,negated_conjecture,
    ( ~ p19(f13(f11(X1)),f13(f11(X2)))
    | ~ p2(f12(f11(X1)),f7(c24))
    | ~ p2(f12(f11(X2)),f7(c24))
    | p20(f17(X1),f17(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20_35) ).

cnf(not_p20_7,negated_conjecture,
    ~ p20(f17(c25),f17(c22)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p20_7) ).

cnf(p2_10,negated_conjecture,
    p2(f12(f11(c22)),f7(c24)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_10) ).

cnf(p2_9,negated_conjecture,
    p2(f12(f11(c25)),f7(c24)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_9) ).

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

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

cnf(c_0_12,negated_conjecture,
    p2(X1,X1),
    p2_5 ).

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

cnf(c_0_14,negated_conjecture,
    p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    p2_33 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p19(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p19(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p19_28]) ).

cnf(c_0_16,negated_conjecture,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c23))),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    p2_34 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p19(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p19(X1,X2) ),
    c_0_15 ).

cnf(c_0_19,negated_conjecture,
    p19(f13(f11(c23)),f13(f11(c22))),
    p19_12 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),X1)
    | p2(X1,f13(f11(c23))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p2(f13(f11(c23)),X1)
    | ~ p2(f13(f11(c22)),X2)
    | p19(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    p2(f13(f11(c25)),f13(f11(c23))),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p19(f13(f11(X1)),f13(f11(X2)))
    | ~ p2(f12(f11(X1)),f7(c24))
    | ~ p2(f12(f11(X2)),f7(c24))
    | p20(f17(X1),f17(X2)) ),
    inference(fof_simplification,[status(thm)],[p20_35]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p2(f13(f11(c23)),X1)
    | p19(X1,f13(f11(c22))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_12]) ).

cnf(c_0_26,negated_conjecture,
    p2(f13(f11(c23)),f13(f11(c25))),
    inference(spm,[status(thm)],[c_0_13,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ~ p20(f17(c25),f17(c22)),
    inference(fof_simplification,[status(thm)],[not_p20_7]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p19(f13(f11(X1)),f13(f11(X2)))
    | ~ p2(f12(f11(X1)),f7(c24))
    | ~ p2(f12(f11(X2)),f7(c24))
    | p20(f17(X1),f17(X2)) ),
    c_0_24 ).

cnf(c_0_29,negated_conjecture,
    p19(f13(f11(c25)),f13(f11(c22))),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    p2(f12(f11(c22)),f7(c24)),
    p2_10 ).

cnf(c_0_31,negated_conjecture,
    p2(f12(f11(c25)),f7(c24)),
    p2_9 ).

cnf(c_0_32,negated_conjecture,
    ~ p20(f17(c25),f17(c22)),
    c_0_27 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN640-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.10/0.36  % Computer : n007.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.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 11:08:50 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/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
% 2.09/0.73  % Version: 3.5.1
% 2.09/0.73  % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.09/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.09/0.73  % Starting new_bool_3 with 300s (1) cores
% 2.09/0.73  % Starting new_bool_1 with 300s (1) cores
% 2.09/0.73  % Starting sh5l with 300s (1) cores
% 2.09/0.73  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 940219 completed with status 0
% 2.09/0.73  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.09/0.73  % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.09/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.09/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.09/0.73  % No SInE strategy applied
% 2.09/0.73  % Search class: FHUNM-FFMM21-DFFFFFNN
% 2.09/0.73  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.09/0.73  % Starting SubtermCWHack with 136s (1) cores
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.09/0.73  % Starting new_bool_3 with 136s (1) cores
% 2.09/0.73  % Starting new_bool_1 with 136s (1) cores
% 2.09/0.73  % new_bool_1 with pid 940231 completed with status 0
% 2.09/0.73  % Result found by new_bool_1
% 2.09/0.73  % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.09/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.09/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.09/0.73  % No SInE strategy applied
% 2.09/0.73  % Search class: FHUNM-FFMM21-DFFFFFNN
% 2.09/0.73  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.09/0.73  % Starting SubtermCWHack with 136s (1) cores
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.09/0.73  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.09/0.73  % Starting new_bool_3 with 136s (1) cores
% 2.09/0.73  % Starting new_bool_1 with 136s (1) cores
% 2.09/0.73  % Preprocessing time       : 0.002 s
% 2.09/0.73  % Presaturation interreduction done
% 2.09/0.73  
% 2.09/0.73  % Proof found!
% 2.09/0.73  % SZS status Unsatisfiable
% 2.09/0.73  % SZS output start CNFRefutation
% See solution above
% 2.09/0.73  % Parsed axioms                        : 42
% 2.09/0.73  % Removed by relevancy pruning/SinE    : 0
% 2.09/0.73  % Initial clauses                      : 42
% 2.09/0.73  % Removed in clause preprocessing      : 0
% 2.09/0.73  % Initial clauses in saturation        : 42
% 2.09/0.73  % Processed clauses                    : 1542
% 2.09/0.73  % ...of these trivial                  : 303
% 2.09/0.73  % ...subsumed                          : 0
% 2.09/0.73  % ...remaining for further processing  : 1239
% 2.09/0.73  % Other redundant clauses eliminated   : 0
% 2.09/0.73  % Clauses deleted for lack of memory   : 0
% 2.09/0.73  % Backward-subsumed                    : 0
% 2.09/0.73  % Backward-rewritten                   : 0
% 2.09/0.73  % Generated clauses                    : 25990
% 2.09/0.73  % ...of the previous two non-redundant : 24175
% 2.09/0.73  % ...aggressively subsumed             : 0
% 2.09/0.73  % Contextual simplify-reflections      : 0
% 2.09/0.73  % Paramodulations                      : 25990
% 2.09/0.73  % Factorizations                       : 0
% 2.09/0.73  % NegExts                              : 0
% 2.09/0.73  % Equation resolutions                 : 0
% 2.09/0.73  % Disequality decompositions           : 0
% 2.09/0.73  % Total rewrite steps                  : 2120
% 2.09/0.73  % ...of those cached                   : 1340
% 2.09/0.73  % Propositional unsat checks           : 0
% 2.09/0.73  %    Propositional check models        : 0
% 2.09/0.73  %    Propositional check unsatisfiable : 0
% 2.09/0.73  %    Propositional clauses             : 0
% 2.09/0.73  %    Propositional clauses after purity: 0
% 2.09/0.73  %    Propositional unsat core size     : 0
% 2.09/0.73  %    Propositional preprocessing time  : 0.000
% 2.09/0.73  %    Propositional encoding time       : 0.000
% 2.09/0.73  %    Propositional solver time         : 0.000
% 2.09/0.73  %    Success case prop preproc time    : 0.000
% 2.09/0.73  %    Success case prop encoding time   : 0.000
% 2.09/0.73  %    Success case prop solver time     : 0.000
% 2.09/0.73  % Current number of processed clauses  : 1197
% 2.09/0.73  %    Positive orientable unit clauses  : 610
% 2.09/0.73  %    Positive unorientable unit clauses: 0
% 2.09/0.73  %    Negative unit clauses             : 2
% 2.09/0.73  %    Non-unit-clauses                  : 585
% 2.09/0.73  % Current number of unprocessed clauses: 22716
% 2.09/0.73  % ...number of literals in the above   : 23299
% 2.09/0.73  % Current number of archived formulas  : 0
% 2.09/0.73  % Current number of archived clauses   : 42
% 2.09/0.73  % Clause-clause subsumption calls (NU) : 12563
% 2.09/0.73  % Rec. Clause-clause subsumption calls : 12280
% 2.09/0.73  % Non-unit clause-clause subsumptions  : 0
% 2.09/0.73  % Unit Clause-clause subsumption calls : 473
% 2.09/0.73  % Rewrite failures with RHS unbound    : 0
% 2.09/0.73  % BW rewrite match attempts            : 6250
% 2.09/0.73  % BW rewrite match successes           : 0
% 2.09/0.73  % Condensation attempts                : 0
% 2.09/0.73  % Condensation successes               : 0
% 2.09/0.73  % Termbank termtop insertions          : 609126
% 2.09/0.73  % Search garbage collected termcells   : 100
% 2.09/0.73  
% 2.09/0.73  % -------------------------------------------------
% 2.09/0.73  % User time                : 0.201 s
% 2.09/0.73  % System time              : 0.017 s
% 2.09/0.73  % Total time               : 0.218 s
% 2.09/0.73  % Maximum resident set size: 3704 pages
% 2.09/0.73  
% 2.09/0.73  % -------------------------------------------------
% 2.09/0.73  % User time                : 1.194 s
% 2.09/0.73  % System time              : 0.083 s
% 2.09/0.73  % Total time               : 1.278 s
% 2.09/0.73  % Maximum resident set size: 4608 pages
% 2.09/0.73  % E exiting
%------------------------------------------------------------------------------