↑ Up

E---3.5.1.UNS-CRf.s

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

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

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

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

cnf(p9_12,negated_conjecture,
    ( ~ p10(c11,X1)
    | ~ p10(X1,c12)
    | p9(c13,f3(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_12) ).

cnf(p8_3,negated_conjecture,
    p8(c14,c12),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_3) ).

cnf(p8_5,negated_conjecture,
    p8(c11,c14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_5) ).

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

cnf(p9_6,negated_conjecture,
    p9(c13,c15,c14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_6) ).

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

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

cnf(not_p8_20,negated_conjecture,
    ( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1)))
    | ~ p8(c11,X1)
    | ~ p8(X1,c12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p8_20) ).

cnf(p2_15,negated_conjecture,
    p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_15) ).

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

cnf(c_0_12,negated_conjecture,
    ( ~ p9(X3,X2,X4)
    | ~ p9(X3,X1,X4)
    | p2(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p2_11]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p10(c11,X1)
    | ~ p10(X1,c12)
    | p9(c13,f3(X1),X1) ),
    inference(fof_simplification,[status(thm)],[p9_12]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ p8(X1,X2)
    | p10(X1,X2) ),
    c_0_11 ).

cnf(c_0_15,negated_conjecture,
    p8(c14,c12),
    p8_3 ).

cnf(c_0_16,negated_conjecture,
    p8(c11,c14),
    p8_5 ).

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

cnf(c_0_18,negated_conjecture,
    ( ~ p9(X3,X2,X4)
    | ~ p9(X3,X1,X4)
    | p2(X1,X2) ),
    c_0_12 ).

cnf(c_0_19,negated_conjecture,
    p9(c13,c15,c14),
    p9_6 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p10(c11,X1)
    | ~ p10(X1,c12)
    | p9(c13,f3(X1),X1) ),
    c_0_13 ).

cnf(c_0_21,negated_conjecture,
    p10(c14,c12),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    p10(c11,c14),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_17 ).

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

cnf(c_0_25,negated_conjecture,
    ( ~ p9(c13,X1,c14)
    | p2(X1,c15) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    p9(c13,f3(c14),c14),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p2(f4(X1,X2),f4(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p2_16]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p2(X2,X1)
    | p2(X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    p2(f3(c14),c15),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p2(X2,X4)
    | ~ p2(X1,X3)
    | p2(f4(X1,X2),f4(X3,X4)) ),
    c_0_27 ).

cnf(c_0_31,negated_conjecture,
    p2(c15,f3(c14)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ p2(X1,X2)
    | p2(f4(X1,c15),f4(X2,f3(c14))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1)))
    | ~ p8(c11,X1)
    | ~ p8(X1,c12) ),
    inference(fof_simplification,[status(thm)],[not_p8_20]) ).

cnf(c_0_34,negated_conjecture,
    p2(f4(X1,c15),f4(X1,f3(c14))),
    inference(spm,[status(thm)],[c_0_32,c_0_24]) ).

cnf(c_0_35,negated_conjecture,
    p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
    p2_15 ).

cnf(c_0_36,negated_conjecture,
    ( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1)))
    | ~ p8(c11,X1)
    | ~ p8(X1,c12) ),
    c_0_33 ).

cnf(c_0_37,negated_conjecture,
    ( ~ p2(f4(X2,c15),X1)
    | p2(X1,f4(X2,f3(c14))) ),
    inference(spm,[status(thm)],[c_0_23,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))),
    inference(spm,[status(thm)],[c_0_28,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_16])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN569-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.10/0.57  % Computer : n026.cluster.edu
% 0.10/0.57  % Model    : x86_64 x86_64
% 0.10/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57  % Memory   : 8046.5625MB
% 0.10/0.57  % OS       : Linux 6.8.0-71-generic
% 0.10/0.57  % CPULimit : 300
% 0.10/0.57  % WCLimit  : 300
% 0.10/0.57  % DateTime : Mon Sep 21 11:11:38 UTC 2026
% 0.10/0.57  % CPUTime  : 
% 0.10/0.57  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.61  Running first-order theorem proving
% 0.14/0.61  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.66  % Version: 3.5.1
% 0.15/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.66  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.66  % Starting sh5l with 300s (1) cores
% 0.15/0.66  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2116955 completed with status 0
% 0.15/0.66  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.66  % No SInE strategy applied
% 0.15/0.66  % Search class: FHHNS-FFSS21-SFFFFFNN
% 0.15/0.66  % partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.15/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.66  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.66  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.66  % Starting new_bool_1 with 136s (1) cores
% 0.15/0.66  % new_bool_3 with pid 2116965 completed with status 0
% 0.15/0.66  % Result found by new_bool_3
% 0.15/0.66  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.66  % No SInE strategy applied
% 0.15/0.66  % Search class: FHHNS-FFSS21-SFFFFFNN
% 0.15/0.66  % partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.15/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.66  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.66  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.66  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.66  % Preprocessing time       : 0.001 s
% 0.15/0.66  % Presaturation interreduction done
% 0.15/0.66  
% 0.15/0.66  % Proof found!
% 0.15/0.66  % SZS status Unsatisfiable
% 0.15/0.66  % SZS output start CNFRefutation
% See solution above
% 0.15/0.66  % Parsed axioms                        : 20
% 0.15/0.66  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.66  % Initial clauses                      : 20
% 0.15/0.66  % Removed in clause preprocessing      : 0
% 0.15/0.66  % Initial clauses in saturation        : 20
% 0.15/0.66  % Processed clauses                    : 196
% 0.15/0.66  % ...of these trivial                  : 26
% 0.15/0.66  % ...subsumed                          : 0
% 0.15/0.66  % ...remaining for further processing  : 170
% 0.15/0.66  % Other redundant clauses eliminated   : 0
% 0.15/0.66  % Clauses deleted for lack of memory   : 0
% 0.15/0.66  % Backward-subsumed                    : 5
% 0.15/0.66  % Backward-rewritten                   : 6
% 0.15/0.66  % Generated clauses                    : 1267
% 0.15/0.66  % ...of the previous two non-redundant : 1095
% 0.15/0.66  % ...aggressively subsumed             : 0
% 0.15/0.66  % Contextual simplify-reflections      : 0
% 0.15/0.66  % Paramodulations                      : 1267
% 0.15/0.66  % Factorizations                       : 0
% 0.15/0.66  % NegExts                              : 0
% 0.15/0.66  % Equation resolutions                 : 0
% 0.15/0.66  % Disequality decompositions           : 0
% 0.15/0.66  % Total rewrite steps                  : 205
% 0.15/0.66  % ...of those cached                   : 98
% 0.15/0.66  % Propositional unsat checks           : 0
% 0.15/0.66  %    Propositional check models        : 0
% 0.15/0.66  %    Propositional check unsatisfiable : 0
% 0.15/0.66  %    Propositional clauses             : 0
% 0.15/0.66  %    Propositional clauses after purity: 0
% 0.15/0.66  %    Propositional unsat core size     : 0
% 0.15/0.66  %    Propositional preprocessing time  : 0.000
% 0.15/0.66  %    Propositional encoding time       : 0.000
% 0.15/0.66  %    Propositional solver time         : 0.000
% 0.15/0.66  %    Success case prop preproc time    : 0.000
% 0.15/0.66  %    Success case prop encoding time   : 0.000
% 0.15/0.66  %    Success case prop solver time     : 0.000
% 0.15/0.66  % Current number of processed clauses  : 139
% 0.15/0.66  %    Positive orientable unit clauses  : 57
% 0.15/0.66  %    Positive unorientable unit clauses: 0
% 0.15/0.66  %    Negative unit clauses             : 1
% 0.15/0.66  %    Non-unit-clauses                  : 81
% 0.15/0.66  % Current number of unprocessed clauses: 938
% 0.15/0.66  % ...number of literals in the above   : 1051
% 0.15/0.66  % Current number of archived formulas  : 0
% 0.15/0.66  % Current number of archived clauses   : 31
% 0.15/0.66  % Clause-clause subsumption calls (NU) : 732
% 0.15/0.66  % Rec. Clause-clause subsumption calls : 615
% 0.15/0.66  % Non-unit clause-clause subsumptions  : 5
% 0.15/0.66  % Unit Clause-clause subsumption calls : 54
% 0.15/0.66  % Rewrite failures with RHS unbound    : 0
% 0.15/0.66  % BW rewrite match attempts            : 111
% 0.15/0.66  % BW rewrite match successes           : 6
% 0.15/0.66  % Condensation attempts                : 0
% 0.15/0.66  % Condensation successes               : 0
% 0.15/0.66  % Termbank termtop insertions          : 24663
% 0.15/0.66  % Search garbage collected termcells   : 72
% 0.15/0.66  
% 0.15/0.66  % -------------------------------------------------
% 0.15/0.66  % User time                : 0.020 s
% 0.15/0.66  % System time              : 0.006 s
% 0.15/0.66  % Total time               : 0.026 s
% 0.15/0.66  % Maximum resident set size: 3648 pages
% 0.15/0.66  
% 0.15/0.66  % -------------------------------------------------
% 0.15/0.66  % User time                : 0.109 s
% 0.15/0.66  % System time              : 0.021 s
% 0.15/0.66  % Total time               : 0.130 s
% 0.15/0.66  % Maximum resident set size: 4608 pages
% 0.15/0.66  % E exiting
%------------------------------------------------------------------------------