↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.13s 0.45s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   48 (  14 unt;   3 nHn;  42 RR)
%            Number of literals    :  102 (   0 equ;  57 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  13 con; 0-2 aty)
%            Number of variables   :   66 (   0 sgn)

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

cnf(p29_38,negated_conjecture,
    ( ~ p10(X4,X2)
    | ~ p4(X3,X1)
    | ~ p29(X3,X4)
    | p29(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p29_38) ).

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

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

cnf(p10_41,negated_conjecture,
    p10(c38,f14(f19(c35,f14(f19(c35,c37),c39)),f17(c36,c40))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10_41) ).

cnf(p29_18,negated_conjecture,
    ( ~ p27(f12(c32,X2),X1)
    | p29(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p29_18) ).

cnf(p27_55,negated_conjecture,
    ( ~ p27(f12(c32,X1),f5(c33,f8(c34,c30)))
    | ~ p28(f21(c30,X2),c31)
    | p27(f12(c32,f14(f19(c35,X1),f17(c36,X2))),f5(c33,f8(c34,c30))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p27_55) ).

cnf(not_p29_17,negated_conjecture,
    ~ p29(f5(c33,f8(c34,c30)),c38),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p29_17) ).

cnf(p27_19,negated_conjecture,
    ( ~ p29(X2,X1)
    | p27(f12(c32,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p27_19) ).

cnf(p29_53,negated_conjecture,
    ( ~ p28(f21(c30,f26(c43,X1)),c31)
    | ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p29_53) ).

cnf(p28_37,negated_conjecture,
    ( ~ p29(f24(c42,X1),c39)
    | p28(f21(c30,X1),c31) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p28_37) ).

cnf(p29_52,negated_conjecture,
    ( ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1)
    | p29(f24(c42,f26(c43,X1)),c39) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p29_52) ).

cnf(p28_20,negated_conjecture,
    ( ~ p16(X1,c40)
    | p28(f21(c30,X1),c31) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p28_20) ).

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

cnf(c_0_14,negated_conjecture,
    ( ~ p10(X3,X2)
    | ~ p10(X3,X1)
    | p10(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p10_22]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p10(X4,X2)
    | ~ p4(X3,X1)
    | ~ p29(X3,X4)
    | p29(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p29_38]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p10(X3,X2)
    | ~ p10(X3,X1)
    | p10(X1,X2) ),
    c_0_14 ).

cnf(c_0_17,negated_conjecture,
    p10(X1,X1),
    p10_1 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p10(X4,X2)
    | ~ p4(X3,X1)
    | ~ p29(X3,X4)
    | p29(X1,X2) ),
    c_0_15 ).

cnf(c_0_19,negated_conjecture,
    p4(X1,X1),
    p4_5 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p10(X2,X1)
    | p10(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    p10(c38,f14(f19(c35,f14(f19(c35,c37),c39)),f17(c36,c40))),
    p10_41 ).

cnf(c_0_22,negated_conjecture,
    ( ~ p27(f12(c32,X2),X1)
    | p29(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p29_18]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p27(f12(c32,X1),f5(c33,f8(c34,c30)))
    | ~ p28(f21(c30,X2),c31)
    | p27(f12(c32,f14(f19(c35,X1),f17(c36,X2))),f5(c33,f8(c34,c30))) ),
    inference(fof_simplification,[status(thm)],[p27_55]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p10(X3,X2)
    | ~ p29(X1,X3)
    | p29(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    p10(f14(f19(c35,f14(f19(c35,c37),c39)),f17(c36,c40)),c38),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p27(f12(c32,X2),X1)
    | p29(X1,X2) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    ( ~ p27(f12(c32,X1),f5(c33,f8(c34,c30)))
    | ~ p28(f21(c30,X2),c31)
    | p27(f12(c32,f14(f19(c35,X1),f17(c36,X2))),f5(c33,f8(c34,c30))) ),
    c_0_23 ).

cnf(c_0_28,negated_conjecture,
    ~ p29(f5(c33,f8(c34,c30)),c38),
    inference(fof_simplification,[status(thm)],[not_p29_17]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ p29(X1,f14(f19(c35,f14(f19(c35,c37),c39)),f17(c36,c40)))
    | p29(X1,c38) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p27(f12(c32,X1),f5(c33,f8(c34,c30)))
    | ~ p28(f21(c30,X2),c31)
    | p29(f5(c33,f8(c34,c30)),f14(f19(c35,X1),f17(c36,X2))) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ~ p29(f5(c33,f8(c34,c30)),c38),
    c_0_28 ).

cnf(c_0_32,negated_conjecture,
    ( ~ p29(X2,X1)
    | p27(f12(c32,X1),X2) ),
    inference(fof_simplification,[status(thm)],[p27_19]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p28(f21(c30,f26(c43,X1)),c31)
    | ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1) ),
    inference(fof_simplification,[status(thm)],[p29_53]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p29(f24(c42,X1),c39)
    | p28(f21(c30,X1),c31) ),
    inference(fof_simplification,[status(thm)],[p28_37]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1)
    | p29(f24(c42,f26(c43,X1)),c39) ),
    inference(fof_simplification,[status(thm)],[p29_52]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ p27(f12(c32,f14(f19(c35,c37),c39)),f5(c33,f8(c34,c30)))
    | ~ p28(f21(c30,c40),c31) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ p29(X2,X1)
    | p27(f12(c32,X1),X2) ),
    c_0_32 ).

cnf(c_0_38,negated_conjecture,
    ( ~ p28(f21(c30,f26(c43,X1)),c31)
    | ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1) ),
    c_0_33 ).

cnf(c_0_39,negated_conjecture,
    ( ~ p29(f24(c42,X1),c39)
    | p28(f21(c30,X1),c31) ),
    c_0_34 ).

cnf(c_0_40,negated_conjecture,
    ( ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1)
    | p29(f24(c42,f26(c43,X1)),c39) ),
    c_0_35 ).

cnf(c_0_41,negated_conjecture,
    ( ~ p29(f5(c33,f8(c34,c30)),f14(f19(c35,c37),c39))
    | ~ p28(f21(c30,c40),c31) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ p10(X1,f14(f19(c35,c37),c39))
    | p29(f5(c33,f8(c34,c30)),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ p16(X1,c40)
    | p28(f21(c30,X1),c31) ),
    inference(fof_simplification,[status(thm)],[p28_20]) ).

cnf(c_0_44,negated_conjecture,
    ~ p28(f21(c30,c40),c31),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_17])]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ p16(X1,c40)
    | p28(f21(c30,X1),c31) ),
    c_0_43 ).

cnf(c_0_46,negated_conjecture,
    p16(X1,X1),
    p16_12 ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN673-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.13/0.38  % Computer : n004.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 21 11:11:52 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/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
% 0.13/0.45  % Version: 3.5.1
% 0.13/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45  % Starting sh5l with 300s (1) cores
% 0.13/0.45  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2995109 completed with status 0
% 0.13/0.45  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45  % No SInE strategy applied
% 0.13/0.45  % Search class: FGUNM-FFMF22-MFFFFFNN
% 0.13/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.13/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.13/0.45  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2995115 completed with status 0
% 0.13/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45  % No SInE strategy applied
% 0.13/0.45  % Search class: FGUNM-FFMF22-MFFFFFNN
% 0.13/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.45  % Preprocessing time       : 0.001 s
% 0.13/0.45  % Presaturation interreduction done
% 0.13/0.45  
% 0.13/0.45  % Proof found!
% 0.13/0.45  % SZS status Unsatisfiable
% 0.13/0.45  % SZS output start CNFRefutation
% See solution above
% 0.13/0.45  % Parsed axioms                        : 55
% 0.13/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.45  % Initial clauses                      : 55
% 0.13/0.45  % Removed in clause preprocessing      : 0
% 0.13/0.45  % Initial clauses in saturation        : 55
% 0.13/0.45  % Processed clauses                    : 257
% 0.13/0.45  % ...of these trivial                  : 0
% 0.13/0.45  % ...subsumed                          : 50
% 0.13/0.45  % ...remaining for further processing  : 207
% 0.13/0.45  % Other redundant clauses eliminated   : 0
% 0.13/0.45  % Clauses deleted for lack of memory   : 0
% 0.13/0.45  % Backward-subsumed                    : 5
% 0.13/0.45  % Backward-rewritten                   : 0
% 0.13/0.45  % Generated clauses                    : 362
% 0.13/0.45  % ...of the previous two non-redundant : 294
% 0.13/0.45  % ...aggressively subsumed             : 0
% 0.13/0.45  % Contextual simplify-reflections      : 1
% 0.13/0.45  % Paramodulations                      : 362
% 0.13/0.45  % Factorizations                       : 0
% 0.13/0.45  % NegExts                              : 0
% 0.13/0.45  % Equation resolutions                 : 0
% 0.13/0.45  % Disequality decompositions           : 0
% 0.13/0.45  % Total rewrite steps                  : 115
% 0.13/0.45  % ...of those cached                   : 87
% 0.13/0.45  % Propositional unsat checks           : 0
% 0.13/0.45  %    Propositional check models        : 0
% 0.13/0.45  %    Propositional check unsatisfiable : 0
% 0.13/0.45  %    Propositional clauses             : 0
% 0.13/0.45  %    Propositional clauses after purity: 0
% 0.13/0.45  %    Propositional unsat core size     : 0
% 0.13/0.45  %    Propositional preprocessing time  : 0.000
% 0.13/0.45  %    Propositional encoding time       : 0.000
% 0.13/0.45  %    Propositional solver time         : 0.000
% 0.13/0.45  %    Success case prop preproc time    : 0.000
% 0.13/0.45  %    Success case prop encoding time   : 0.000
% 0.13/0.45  %    Success case prop solver time     : 0.000
% 0.13/0.45  % Current number of processed clauses  : 147
% 0.13/0.45  %    Positive orientable unit clauses  : 27
% 0.13/0.45  %    Positive unorientable unit clauses: 0
% 0.13/0.45  %    Negative unit clauses             : 9
% 0.13/0.45  %    Non-unit-clauses                  : 111
% 0.13/0.45  % Current number of unprocessed clauses: 147
% 0.13/0.45  % ...number of literals in the above   : 424
% 0.13/0.45  % Current number of archived formulas  : 0
% 0.13/0.45  % Current number of archived clauses   : 60
% 0.13/0.45  % Clause-clause subsumption calls (NU) : 4018
% 0.13/0.45  % Rec. Clause-clause subsumption calls : 3405
% 0.13/0.45  % Non-unit clause-clause subsumptions  : 32
% 0.13/0.45  % Unit Clause-clause subsumption calls : 117
% 0.13/0.45  % Rewrite failures with RHS unbound    : 0
% 0.13/0.45  % BW rewrite match attempts            : 8
% 0.13/0.45  % BW rewrite match successes           : 0
% 0.13/0.45  % Condensation attempts                : 0
% 0.13/0.45  % Condensation successes               : 0
% 0.13/0.45  % Termbank termtop insertions          : 8604
% 0.13/0.45  % Search garbage collected termcells   : 189
% 0.13/0.45  
% 0.13/0.45  % -------------------------------------------------
% 0.13/0.45  % User time                : 0.011 s
% 0.13/0.45  % System time              : 0.004 s
% 0.13/0.45  % Total time               : 0.015 s
% 0.13/0.45  % Maximum resident set size: 3436 pages
% 0.13/0.45  
% 0.13/0.45  % -------------------------------------------------
% 0.13/0.45  % User time                : 0.065 s
% 0.13/0.45  % System time              : 0.015 s
% 0.13/0.45  % Total time               : 0.080 s
% 0.13/0.45  % Maximum resident set size: 4608 pages
% 0.13/0.45  % E exiting
%------------------------------------------------------------------------------