↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   39 (  14 unt;   3 nHn;  33 RR)
%            Number of literals    :   88 (   0 equ;  52 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   78 (   0 sgn)

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

cnf(p2_15,negated_conjecture,
    ( p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10)))))
    | p2(X1,f3(c10)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_15) ).

cnf(not_p2_2,negated_conjecture,
    ~ p2(c9,f3(c10)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_2) ).

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

cnf(p8_12,negated_conjecture,
    ( ~ p2(X4,X1)
    | ~ p8(X4,X3)
    | ~ p2(X3,X2)
    | p8(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_12) ).

cnf(p8_10,negated_conjecture,
    p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_10) ).

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

cnf(p2_14,negated_conjecture,
    ( ~ p2(X1,X3)
    | ~ p2(X2,X4)
    | p2(f6(X1,X2),f6(X3,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_14) ).

cnf(p2_4,negated_conjecture,
    p2(f4(X1),f5(X1,f3(f7(c10)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

cnf(p2_7,negated_conjecture,
    ( ~ p2(X1,X2)
    | p2(f4(X1),f4(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_7) ).

cnf(not_p8_11,negated_conjecture,
    ~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p8_11) ).

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

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

cnf(c_0_13,negated_conjecture,
    ( p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10)))))
    | p2(X1,f3(c10)) ),
    p2_15 ).

cnf(c_0_14,negated_conjecture,
    ~ p2(c9,f3(c10)),
    inference(fof_simplification,[status(thm)],[not_p2_2]) ).

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

cnf(c_0_16,negated_conjecture,
    ( ~ p2(X4,X1)
    | ~ p8(X4,X3)
    | ~ p2(X3,X2)
    | p8(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p8_12]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ p8(X1,f6(X2,X3))
    | p2(X2,f3(c10))
    | p8(X1,f6(X2,f5(X3,f3(f7(c10))))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))),
    p8_10 ).

cnf(c_0_19,negated_conjecture,
    ~ p2(c9,f3(c10)),
    c_0_14 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_15 ).

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

cnf(c_0_22,negated_conjecture,
    ( ~ p2(X1,X3)
    | ~ p2(X2,X4)
    | p2(f6(X1,X2),f6(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p2_14]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p2(X4,X1)
    | ~ p8(X4,X3)
    | ~ p2(X3,X2)
    | p8(X1,X2) ),
    c_0_16 ).

cnf(c_0_24,negated_conjecture,
    p8(f6(c9,f4(c12)),f6(c9,f5(f4(f5(c12,c14)),f3(f7(c10))))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p2(X2,X1)
    | p2(X1,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p2(X1,X3)
    | ~ p2(X2,X4)
    | p2(f6(X1,X2),f6(X3,X4)) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    ( ~ p2(f6(c9,f4(c12)),X1)
    | ~ p2(f6(c9,f5(f4(f5(c12,c14)),f3(f7(c10)))),X2)
    | p8(X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p2(X3,X1)
    | ~ p2(X4,X2)
    | p2(f6(X1,X2),f6(X3,X4)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    p2(f4(X1),f5(X1,f3(f7(c10)))),
    p2_4 ).

cnf(c_0_30,negated_conjecture,
    ( ~ p2(X2,c9)
    | ~ p2(f6(c9,f4(c12)),X1)
    | ~ p2(X3,f5(f4(f5(c12,c14)),f3(f7(c10))))
    | p8(X1,f6(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ p2(f4(X2),X1)
    | p2(X1,f5(X2,f3(f7(c10)))) ),
    inference(spm,[status(thm)],[c_0_20,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ p2(X1,X2)
    | p2(f4(X1),f4(X2)) ),
    inference(fof_simplification,[status(thm)],[p2_7]) ).

cnf(c_0_33,negated_conjecture,
    ~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
    inference(fof_simplification,[status(thm)],[not_p8_11]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p2(X2,c9)
    | ~ p2(f6(c9,f4(c12)),X1)
    | ~ p2(f4(f4(f5(c12,c14))),X3)
    | p8(X1,f6(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ p2(X1,X2)
    | p2(f4(X1),f4(X2)) ),
    c_0_32 ).

cnf(c_0_36,negated_conjecture,
    ~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
    c_0_33 ).

cnf(c_0_37,negated_conjecture,
    ( ~ p2(X2,c9)
    | ~ p2(f4(f5(c12,c14)),X3)
    | ~ p2(f6(c9,f4(c12)),X1)
    | p8(X1,f6(X2,f4(X3))) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]),c_0_21]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN560-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.11/0.37  % Computer : n017.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:03:57 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.45  % Version: 3.5.1
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2174826 completed with status 0
% 0.15/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FGUNS-FFSF21-MFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2174834 completed with status 0
% 0.15/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FGUNS-FFSF21-MFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.45  % Preprocessing time       : 0.001 s
% 0.15/0.45  % Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  % Proof found!
% 0.15/0.45  % SZS status Unsatisfiable
% 0.15/0.45  % SZS output start CNFRefutation
% See solution above
% 0.15/0.45  % Parsed axioms                        : 15
% 0.15/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.45  % Initial clauses                      : 15
% 0.15/0.45  % Removed in clause preprocessing      : 0
% 0.15/0.45  % Initial clauses in saturation        : 15
% 0.15/0.45  % Processed clauses                    : 184
% 0.15/0.45  % ...of these trivial                  : 1
% 0.15/0.45  % ...subsumed                          : 56
% 0.15/0.45  % ...remaining for further processing  : 127
% 0.15/0.45  % Other redundant clauses eliminated   : 0
% 0.15/0.45  % Clauses deleted for lack of memory   : 0
% 0.15/0.45  % Backward-subsumed                    : 4
% 0.15/0.45  % Backward-rewritten                   : 0
% 0.15/0.45  % Generated clauses                    : 786
% 0.15/0.45  % ...of the previous two non-redundant : 733
% 0.15/0.45  % ...aggressively subsumed             : 0
% 0.15/0.45  % Contextual simplify-reflections      : 0
% 0.15/0.45  % Paramodulations                      : 786
% 0.15/0.45  % Factorizations                       : 0
% 0.15/0.45  % NegExts                              : 0
% 0.15/0.45  % Equation resolutions                 : 0
% 0.15/0.45  % Disequality decompositions           : 0
% 0.15/0.45  % Total rewrite steps                  : 68
% 0.15/0.45  % ...of those cached                   : 49
% 0.15/0.45  % Propositional unsat checks           : 0
% 0.15/0.45  %    Propositional check models        : 0
% 0.15/0.45  %    Propositional check unsatisfiable : 0
% 0.15/0.45  %    Propositional clauses             : 0
% 0.15/0.45  %    Propositional clauses after purity: 0
% 0.15/0.45  %    Propositional unsat core size     : 0
% 0.15/0.45  %    Propositional preprocessing time  : 0.000
% 0.15/0.45  %    Propositional encoding time       : 0.000
% 0.15/0.45  %    Propositional solver time         : 0.000
% 0.15/0.45  %    Success case prop preproc time    : 0.000
% 0.15/0.45  %    Success case prop encoding time   : 0.000
% 0.15/0.45  %    Success case prop solver time     : 0.000
% 0.15/0.45  % Current number of processed clauses  : 108
% 0.15/0.45  %    Positive orientable unit clauses  : 16
% 0.15/0.45  %    Positive unorientable unit clauses: 0
% 0.15/0.45  %    Negative unit clauses             : 2
% 0.15/0.45  %    Non-unit-clauses                  : 90
% 0.15/0.45  % Current number of unprocessed clauses: 572
% 0.15/0.45  % ...number of literals in the above   : 1638
% 0.15/0.45  % Current number of archived formulas  : 0
% 0.15/0.45  % Current number of archived clauses   : 19
% 0.15/0.45  % Clause-clause subsumption calls (NU) : 2277
% 0.15/0.45  % Rec. Clause-clause subsumption calls : 1940
% 0.15/0.45  % Non-unit clause-clause subsumptions  : 60
% 0.15/0.45  % Unit Clause-clause subsumption calls : 2
% 0.15/0.45  % Rewrite failures with RHS unbound    : 0
% 0.15/0.45  % BW rewrite match attempts            : 7
% 0.15/0.45  % BW rewrite match successes           : 0
% 0.15/0.45  % Condensation attempts                : 0
% 0.15/0.45  % Condensation successes               : 0
% 0.15/0.45  % Termbank termtop insertions          : 12069
% 0.15/0.45  % Search garbage collected termcells   : 35
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.019 s
% 0.15/0.45  % System time              : 0.005 s
% 0.15/0.45  % Total time               : 0.024 s
% 0.15/0.45  % Maximum resident set size: 3592 pages
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.071 s
% 0.15/0.45  % System time              : 0.026 s
% 0.15/0.45  % Total time               : 0.097 s
% 0.15/0.45  % Maximum resident set size: 4864 pages
% 0.15/0.45  % E exiting
%------------------------------------------------------------------------------