↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN599-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 : n026.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 199.12s 29.54s
% Output   : CNFRefutation 199.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (  13 unt;   0 nHn;  27 RR)
%            Number of literals    :   66 (   0 equ;  37 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :   11 (   3 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   3 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn)

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

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

cnf(p3_7,negated_conjecture,
    p3(f4(f6(c21)),c22),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_7) ).

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

cnf(p19_29,negated_conjecture,
    ( ~ p18(X1)
    | p19(f15(f16(X1)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X1)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p19_29) ).

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

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

cnf(not_p19_27,negated_conjecture,
    ~ p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p19_27) ).

cnf(c21_is_p18_2,negated_conjecture,
    p18(c21),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21_is_p18_2) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p3(X1,X2)
    | p3(f14(X1),f14(X2)) ),
    inference(fof_simplification,[status(thm)],[p3_15]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p7(X1,X3)
    | ~ p3(X2,X4)
    | p7(f9(X1,X2),f9(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p7_25]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p3(X1,X2)
    | p3(f14(X1),f14(X2)) ),
    c_0_9 ).

cnf(c_0_12,negated_conjecture,
    p3(f4(f6(c21)),c22),
    p3_7 ).

cnf(c_0_13,negated_conjecture,
    ( ~ p19(X3,X4)
    | ~ p7(X4,X2)
    | ~ p7(X3,X1)
    | p19(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p19_23]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ p18(X1)
    | p19(f15(f16(X1)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X1)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ),
    inference(fof_simplification,[status(thm)],[p19_29]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p7(X2,X4)
    | ~ p7(X1,X3)
    | p7(f8(X1,X2),f8(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p7_26]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p7(X1,X3)
    | ~ p3(X2,X4)
    | p7(f9(X1,X2),f9(X3,X4)) ),
    c_0_10 ).

cnf(c_0_17,negated_conjecture,
    p3(f14(f4(f6(c21))),f14(c22)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p19(X3,X4)
    | ~ p7(X4,X2)
    | ~ p7(X3,X1)
    | p19(X1,X2) ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p18(X1)
    | p19(f15(f16(X1)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X1)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ),
    c_0_14 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p7(X2,X4)
    | ~ p7(X1,X3)
    | p7(f8(X1,X2),f8(X3,X4)) ),
    c_0_15 ).

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

cnf(c_0_22,negated_conjecture,
    ( ~ p7(X1,X2)
    | p7(f9(X1,f14(f4(f6(c21)))),f9(X2,f14(c22))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p18(X3)
    | ~ p7(f15(f16(X3)),X1)
    | ~ p7(f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X3)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),X2)
    | p19(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p7(X1,X3)
    | p7(f8(X1,X2),f8(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    p7(f9(X1,f14(f4(f6(c21)))),f9(X1,f14(c22))),
    inference(spm,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ~ p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),
    inference(fof_simplification,[status(thm)],[not_p19_27]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p18(X1)
    | ~ p7(f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X1)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),X2)
    | p19(f15(f16(X1)),X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    p7(f8(f9(X1,f14(f4(f6(c21)))),X2),f8(f9(X1,f14(c22)),X2)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    p18(c21),
    c21_is_p18_2 ).

cnf(c_0_30,negated_conjecture,
    ~ p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),
    c_0_26 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN599-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.12/0.37  % Computer : n026.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 11:12:22 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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
% 199.12/29.54  % Version: 3.5.1
% 199.12/29.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 199.12/29.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 199.12/29.54  % Starting new_bool_3 with 300s (1) cores
% 199.12/29.54  % Starting new_bool_1 with 300s (1) cores
% 199.12/29.54  % Starting sh5l with 300s (1) cores
% 199.12/29.54  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2119391 completed with status 0
% 199.12/29.54  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 199.12/29.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 199.12/29.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 199.12/29.54  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 199.12/29.54  % No SInE strategy applied
% 199.12/29.54  % Search class: FHUNM-FFMS21-DFFFFFNN
% 199.12/29.54  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 199.12/29.54  % Starting SubtermCWHack with 136s (1) cores
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 199.12/29.54  % Starting new_bool_3 with 136s (1) cores
% 199.12/29.54  % Starting new_bool_1 with 136s (1) cores
% 199.12/29.54  % new_bool_3 with pid 2119407 completed with status 0
% 199.12/29.54  % Result found by new_bool_3
% 199.12/29.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 199.12/29.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 199.12/29.54  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 199.12/29.54  % No SInE strategy applied
% 199.12/29.54  % Search class: FHUNM-FFMS21-DFFFFFNN
% 199.12/29.54  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 199.12/29.54  % Starting SubtermCWHack with 136s (1) cores
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 199.12/29.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 199.12/29.54  % Starting new_bool_3 with 136s (1) cores
% 199.12/29.54  % Preprocessing time       : 0.002 s
% 199.12/29.54  % Presaturation interreduction done
% 199.12/29.54  
% 199.12/29.54  % Proof found!
% 199.12/29.54  % SZS status Unsatisfiable
% 199.12/29.54  % SZS output start CNFRefutation
% See solution above
% 199.12/29.54  % Parsed axioms                        : 29
% 199.12/29.54  % Removed by relevancy pruning/SinE    : 0
% 199.12/29.54  % Initial clauses                      : 29
% 199.12/29.54  % Removed in clause preprocessing      : 0
% 199.12/29.54  % Initial clauses in saturation        : 29
% 199.12/29.54  % Processed clauses                    : 27286
% 199.12/29.54  % ...of these trivial                  : 2605
% 199.12/29.54  % ...subsumed                          : 0
% 199.12/29.54  % ...remaining for further processing  : 24681
% 199.12/29.54  % Other redundant clauses eliminated   : 0
% 199.12/29.54  % Clauses deleted for lack of memory   : 0
% 199.12/29.54  % Backward-subsumed                    : 17
% 199.12/29.54  % Backward-rewritten                   : 19
% 199.12/29.54  % Generated clauses                    : 1655712
% 199.12/29.54  % ...of the previous two non-redundant : 1625362
% 199.12/29.54  % ...aggressively subsumed             : 0
% 199.12/29.54  % Contextual simplify-reflections      : 0
% 199.12/29.54  % Paramodulations                      : 1655712
% 199.12/29.54  % Factorizations                       : 0
% 199.12/29.54  % NegExts                              : 0
% 199.12/29.54  % Equation resolutions                 : 0
% 199.12/29.54  % Disequality decompositions           : 0
% 199.12/29.54  % Total rewrite steps                  : 32966
% 199.12/29.54  % ...of those cached                   : 8642
% 199.12/29.54  % Propositional unsat checks           : 4
% 199.12/29.54  %    Propositional check models        : 3
% 199.12/29.54  %    Propositional check unsatisfiable : 0
% 199.12/29.54  %    Propositional clauses             : 0
% 199.12/29.54  %    Propositional clauses after purity: 0
% 199.12/29.54  %    Propositional unsat core size     : 0
% 199.12/29.54  %    Propositional preprocessing time  : 0.000
% 199.12/29.54  %    Propositional encoding time       : 3.318
% 199.12/29.54  %    Propositional solver time         : 0.154
% 199.12/29.54  %    Success case prop preproc time    : 0.000
% 199.12/29.54  %    Success case prop encoding time   : 0.000
% 199.12/29.54  %    Success case prop solver time     : 0.000
% 199.12/29.54  % Current number of processed clauses  : 24616
% 199.12/29.54  %    Positive orientable unit clauses  : 14485
% 199.12/29.54  %    Positive unorientable unit clauses: 0
% 199.12/29.54  %    Negative unit clauses             : 1
% 199.12/29.54  %    Non-unit-clauses                  : 10130
% 199.12/29.54  % Current number of unprocessed clauses: 1597831
% 199.12/29.54  % ...number of literals in the above   : 1616709
% 199.12/29.54  % Current number of archived formulas  : 0
% 199.12/29.54  % Current number of archived clauses   : 65
% 199.12/29.54  % Clause-clause subsumption calls (NU) : 7071143
% 199.12/29.54  % Rec. Clause-clause subsumption calls : 5977728
% 199.12/29.54  % Non-unit clause-clause subsumptions  : 17
% 199.12/29.54  % Unit Clause-clause subsumption calls : 88624
% 199.12/29.54  % Rewrite failures with RHS unbound    : 0
% 199.12/29.54  % BW rewrite match attempts            : 3382775
% 199.12/29.54  % BW rewrite match successes           : 19
% 199.12/29.54  % Condensation attempts                : 0
% 199.12/29.54  % Condensation successes               : 0
% 199.12/29.54  % Termbank termtop insertions          : 56474735
% 199.12/29.54  % Search garbage collected termcells   : 74
% 199.12/29.54  
% 199.12/29.54  % -------------------------------------------------
% 199.12/29.54  % User time                : 26.512 s
% 199.12/29.54  % System time              : 1.338 s
% 199.12/29.54  % Total time               : 27.850 s
% 199.12/29.54  % Maximum resident set size: 3668 pages
% 199.12/29.54  
% 199.12/29.54  % -------------------------------------------------
% 199.12/29.54  % User time                : 134.801 s
% 199.12/29.54  % System time              : 6.317 s
% 199.12/29.54  % Total time               : 141.118 s
% 199.12/29.54  % Maximum resident set size: 4864 pages
% 199.12/29.54  % E exiting
%------------------------------------------------------------------------------