↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.14s 5.45s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   43 (  19 unt;   4 nHn;  37 RR)
%            Number of literals    :   91 (   0 equ;  49 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn)

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

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

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

cnf(p2_7,negated_conjecture,
    p2(c16,f5(c14)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_7) ).

cnf(p9_20,negated_conjecture,
    ( ~ p3(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_20) ).

cnf(p3_8,negated_conjecture,
    p3(f4(f5(X1)),f4(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_8) ).

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

cnf(p9_11,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f4(c16)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_11) ).

cnf(not_p11_23,negated_conjecture,
    ( ~ p9(f8(X2,X1),f4(X1))
    | ~ p9(f8(X2,X1),X2)
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p11_23) ).

cnf(p9_5,negated_conjecture,
    p9(c12,c13),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_5) ).

cnf(p9_22,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c15)
    | p9(f8(X1,X2),f4(X2))
    | p9(f8(X1,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_22) ).

cnf(p11_6,negated_conjecture,
    p11(c14,c15),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_6) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_17]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1),f4(X2)) ),
    inference(fof_simplification,[status(thm)],[p3_14]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    c_0_12 ).

cnf(c_0_15,negated_conjecture,
    p3(X1,X1),
    p3_3 ).

cnf(c_0_16,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1),f4(X2)) ),
    c_0_13 ).

cnf(c_0_17,negated_conjecture,
    p2(c16,f5(c14)),
    p2_7 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p3(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p9_20]) ).

cnf(c_0_19,negated_conjecture,
    p3(f4(f5(X1)),f4(X1)),
    p3_8 ).

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

cnf(c_0_21,negated_conjecture,
    p3(f4(c16),f4(f5(c14))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p3(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    c_0_18 ).

cnf(c_0_23,negated_conjecture,
    p7(X1,X1),
    p7_2 ).

cnf(c_0_24,negated_conjecture,
    ( ~ p3(f4(f5(X2)),X1)
    | p3(X1,f4(X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    p3(f4(f5(c14)),f4(c16)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f4(c16)) ),
    inference(fof_simplification,[status(thm)],[p9_11]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p9(f8(X2,X1),f4(X1))
    | ~ p9(f8(X2,X1),X2)
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    inference(fof_simplification,[status(thm)],[not_p11_23]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p9(X1,X3)
    | p9(X1,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    p3(f4(c16),f4(c14)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f4(c16)) ),
    c_0_26 ).

cnf(c_0_31,negated_conjecture,
    p9(c12,c13),
    p9_5 ).

cnf(c_0_32,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c15)
    | p9(f8(X1,X2),f4(X2))
    | p9(f8(X1,X2),X1) ),
    inference(fof_simplification,[status(thm)],[p9_22]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p9(f8(X2,X1),f4(X1))
    | ~ p9(f8(X2,X1),X2)
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    c_0_27 ).

cnf(c_0_34,negated_conjecture,
    p11(c14,c15),
    p11_6 ).

cnf(c_0_35,negated_conjecture,
    ( ~ p9(X1,f4(c16))
    | p9(X1,f4(c14)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,negated_conjecture,
    p9(c12,f4(c16)),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c15)
    | p9(f8(X1,X2),f4(X2))
    | p9(f8(X1,X2),X1) ),
    c_0_32 ).

cnf(c_0_38,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p9(f8(X1,c14),X1)
    | ~ p9(f8(X1,c14),f4(c14)) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,negated_conjecture,
    p9(c12,f4(c14)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ p9(c12,X1)
    | p9(f8(X1,c14),X1)
    | p9(f8(X1,c14),f4(c14)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_34]) ).

cnf(c_0_41,negated_conjecture,
    ~ p9(f8(f4(c14),c14),f4(c14)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN578-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.36  % Computer : n017.cluster.edu
% 0.11/5.36  % Model    : x86_64 x86_64
% 0.11/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.36  % Memory   : 8046.5625MB
% 0.11/5.36  % OS       : Linux 6.8.0-71-generic
% 0.11/5.36  % CPULimit : 300
% 0.11/5.36  % WCLimit  : 300
% 0.11/5.36  % DateTime : Mon Sep 21 11:04:18 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41  Running first-order theorem proving
% 0.14/5.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.14/5.45  % Version: 3.5.1
% 0.14/5.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45  % Starting sh5l with 300s (1) cores
% 0.14/5.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2175784 completed with status 0
% 0.14/5.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45  % No SInE strategy applied
% 0.14/5.45  % Search class: FGHNM-FFSS21-SFFFFFNN
% 0.14/5.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.45  % Starting new_bool_3 with 136s (1) cores
% 0.14/5.45  % Starting new_bool_1 with 136s (1) cores
% 0.14/5.45  % new_bool_3 with pid 2175793 completed with status 0
% 0.14/5.45  % Result found by new_bool_3
% 0.14/5.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45  % No SInE strategy applied
% 0.14/5.45  % Search class: FGHNM-FFSS21-SFFFFFNN
% 0.14/5.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.45  % Starting new_bool_3 with 136s (1) cores
% 0.14/5.45  % Preprocessing time       : 0.001 s
% 0.14/5.45  % Presaturation interreduction done
% 0.14/5.45  
% 0.14/5.45  % Proof found!
% 0.14/5.45  % SZS status Unsatisfiable
% 0.14/5.45  % SZS output start CNFRefutation
% See solution above
% 0.14/5.45  % Parsed axioms                        : 23
% 0.14/5.45  % Removed by relevancy pruning/SinE    : 0
% 0.14/5.45  % Initial clauses                      : 23
% 0.14/5.45  % Removed in clause preprocessing      : 0
% 0.14/5.45  % Initial clauses in saturation        : 23
% 0.14/5.45  % Processed clauses                    : 303
% 0.14/5.45  % ...of these trivial                  : 42
% 0.14/5.45  % ...subsumed                          : 0
% 0.14/5.45  % ...remaining for further processing  : 261
% 0.14/5.45  % Other redundant clauses eliminated   : 0
% 0.14/5.45  % Clauses deleted for lack of memory   : 0
% 0.14/5.45  % Backward-subsumed                    : 8
% 0.14/5.45  % Backward-rewritten                   : 10
% 0.14/5.45  % Generated clauses                    : 1120
% 0.14/5.45  % ...of the previous two non-redundant : 657
% 0.14/5.45  % ...aggressively subsumed             : 0
% 0.14/5.45  % Contextual simplify-reflections      : 2
% 0.14/5.45  % Paramodulations                      : 1120
% 0.14/5.45  % Factorizations                       : 0
% 0.14/5.45  % NegExts                              : 0
% 0.14/5.45  % Equation resolutions                 : 0
% 0.14/5.45  % Disequality decompositions           : 0
% 0.14/5.45  % Total rewrite steps                  : 512
% 0.14/5.45  % ...of those cached                   : 345
% 0.14/5.45  % Propositional unsat checks           : 0
% 0.14/5.45  %    Propositional check models        : 0
% 0.14/5.45  %    Propositional check unsatisfiable : 0
% 0.14/5.45  %    Propositional clauses             : 0
% 0.14/5.45  %    Propositional clauses after purity: 0
% 0.14/5.45  %    Propositional unsat core size     : 0
% 0.14/5.45  %    Propositional preprocessing time  : 0.000
% 0.14/5.45  %    Propositional encoding time       : 0.000
% 0.14/5.45  %    Propositional solver time         : 0.000
% 0.14/5.45  %    Success case prop preproc time    : 0.000
% 0.14/5.45  %    Success case prop encoding time   : 0.000
% 0.14/5.45  %    Success case prop solver time     : 0.000
% 0.14/5.45  % Current number of processed clauses  : 220
% 0.14/5.45  %    Positive orientable unit clauses  : 100
% 0.14/5.45  %    Positive unorientable unit clauses: 0
% 0.14/5.45  %    Negative unit clauses             : 3
% 0.14/5.45  %    Non-unit-clauses                  : 117
% 0.14/5.45  % Current number of unprocessed clauses: 377
% 0.14/5.45  % ...number of literals in the above   : 534
% 0.14/5.45  % Current number of archived formulas  : 0
% 0.14/5.45  % Current number of archived clauses   : 41
% 0.14/5.45  % Clause-clause subsumption calls (NU) : 1400
% 0.14/5.45  % Rec. Clause-clause subsumption calls : 1059
% 0.14/5.45  % Non-unit clause-clause subsumptions  : 10
% 0.14/5.45  % Unit Clause-clause subsumption calls : 30
% 0.14/5.45  % Rewrite failures with RHS unbound    : 0
% 0.14/5.45  % BW rewrite match attempts            : 435
% 0.14/5.45  % BW rewrite match successes           : 10
% 0.14/5.45  % Condensation attempts                : 0
% 0.14/5.45  % Condensation successes               : 0
% 0.14/5.45  % Termbank termtop insertions          : 15447
% 0.14/5.45  % Search garbage collected termcells   : 69
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.023 s
% 0.14/5.45  % System time              : 0.003 s
% 0.14/5.45  % Total time               : 0.026 s
% 0.14/5.45  % Maximum resident set size: 3648 pages
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.115 s
% 0.14/5.45  % System time              : 0.014 s
% 0.14/5.45  % Total time               : 0.129 s
% 0.14/5.45  % Maximum resident set size: 4608 pages
% 0.14/5.45  % E exiting
%------------------------------------------------------------------------------