↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN600-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 : n003.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 1.81s 0.80s
% Output   : CNFRefutation 1.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   42 (  16 unt;   0 nHn;  40 RR)
%            Number of literals    :   91 (   0 equ;  52 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :   12 (   3 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (   0 sgn)

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

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

cnf(p7_17,negated_conjecture,
    ( ~ p7(X1,X2)
    | p7(f15(X1),f15(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_17) ).

cnf(p7_7,negated_conjecture,
    p7(f16(c21),f16(c22)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_7) ).

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

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

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

cnf(p17_28,negated_conjecture,
    ( ~ p19(X1)
    | p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),f4(f6(X1))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_28) ).

cnf(p3_29,negated_conjecture,
    ( ~ p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20))))))))))))
    | ~ p18(f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(X1)))
    | ~ p19(X1)
    | p3(f4(f6(X1)),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_29) ).

cnf(c22_is_p19_2,negated_conjecture,
    p19(c22),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c22_is_p19_2) ).

cnf(not_p3_8,negated_conjecture,
    ~ p3(f4(f6(c21)),f4(f6(c22))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p3_8) ).

cnf(c21_is_p19_1,negated_conjecture,
    p19(c21),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c21_is_p19_1) ).

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

cnf(c_0_13,negated_conjecture,
    ( ~ p7(X3,X2)
    | ~ p7(X3,X1)
    | p7(X1,X2) ),
    c_0_12 ).

cnf(c_0_14,negated_conjecture,
    p7(X1,X1),
    p7_4 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p7(X1,X2)
    | p7(f15(X1),f15(X2)) ),
    inference(fof_simplification,[status(thm)],[p7_17]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p7(X2,X1)
    | p7(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    p7(f16(c21),f16(c22)),
    p7_7 ).

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

cnf(c_0_19,negated_conjecture,
    ( ~ p7(X1,X2)
    | p7(f15(X1),f15(X2)) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    p7(f16(c22),f16(c21)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p17(X3,X4)
    | ~ p7(X4,X2)
    | ~ p7(X3,X1)
    | p17(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p17_22]) ).

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

cnf(c_0_23,negated_conjecture,
    p7(f15(f16(c22)),f15(f16(c21))),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p17(X3,X4)
    | ~ p7(X4,X2)
    | ~ p7(X3,X1)
    | p17(X1,X2) ),
    c_0_21 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p7(X2,X1)
    | ~ p18(X2,f15(f16(c22)))
    | p18(X1,f15(f16(c21))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p19(X1)
    | p18(f9(f10(f13(f11(f14(f12(c20)))),f4(f6(X1))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(X1))) ),
    inference(fof_simplification,[status(thm)],[p18_27]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p7(X3,X1)
    | ~ p17(X3,X2)
    | p17(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_14]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p19(X1)
    | p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),f4(f6(X1))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))))) ),
    inference(fof_simplification,[status(thm)],[p17_28]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20))))))))))))
    | ~ p18(f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(X1)))
    | ~ p19(X1)
    | p3(f4(f6(X1)),X2) ),
    inference(fof_simplification,[status(thm)],[p3_29]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p18(X1,f15(f16(c22)))
    | p18(X1,f15(f16(c21))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_14]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ p19(X1)
    | p18(f9(f10(f13(f11(f14(f12(c20)))),f4(f6(X1))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(X1))) ),
    c_0_26 ).

cnf(c_0_32,negated_conjecture,
    p19(c22),
    c22_is_p19_2 ).

cnf(c_0_33,negated_conjecture,
    ( ~ p17(f15(f16(c22)),X1)
    | p17(f15(f16(c21)),X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_23]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p19(X1)
    | p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),f4(f6(X1))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))))) ),
    c_0_28 ).

cnf(c_0_35,negated_conjecture,
    ~ p3(f4(f6(c21)),f4(f6(c22))),
    inference(fof_simplification,[status(thm)],[not_p3_8]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ p17(f15(f16(X1)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20))))))))))))
    | ~ p18(f9(f10(f13(f11(f14(f12(c20)))),X2),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(X1)))
    | ~ p19(X1)
    | p3(f4(f6(X1)),X2) ),
    c_0_29 ).

cnf(c_0_37,negated_conjecture,
    p18(f9(f10(f13(f11(f14(f12(c20)))),f4(f6(c22))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))),f15(f16(c21))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_38,negated_conjecture,
    p17(f15(f16(c21)),f8(f13(f11(f14(f12(c20)))),f9(f10(f13(f11(f14(f12(c20)))),f4(f6(c22))),f10(f13(f11(f14(f12(c20)))),f11(f12(f12(f12(f12(f12(f12(f12(c20)))))))))))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32])]) ).

cnf(c_0_39,negated_conjecture,
    p19(c21),
    c21_is_p19_1 ).

cnf(c_0_40,negated_conjecture,
    ~ p3(f4(f6(c21)),f4(f6(c22))),
    c_0_35 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN600-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.10/0.53  % Computer : n003.cluster.edu
% 0.10/0.53  % Model    : x86_64 x86_64
% 0.10/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.53  % Memory   : 8046.5625MB
% 0.10/0.53  % OS       : Linux 6.8.0-71-generic
% 0.10/0.53  % CPULimit : 300
% 0.10/0.53  % WCLimit  : 300
% 0.10/0.53  % DateTime : Mon Sep 21 11:11:31 UTC 2026
% 0.10/0.53  % CPUTime  : 
% 0.10/0.53  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.57  Running first-order theorem proving
% 0.15/0.57  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
% 1.81/0.80  % Version: 3.5.1
% 1.81/0.80  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.80  % Starting new_bool_3 with 300s (1) cores
% 1.81/0.80  % Starting new_bool_1 with 300s (1) cores
% 1.81/0.80  % Starting sh5l with 300s (1) cores
% 1.81/0.80  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4143790 completed with status 0
% 1.81/0.80  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.81/0.80  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.81/0.80  % No SInE strategy applied
% 1.81/0.80  % Search class: FHUNM-FFMS21-DFFFFFNN
% 1.81/0.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.80  % Starting SubtermCWHack with 136s (1) cores
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 1.81/0.80  % Starting new_bool_3 with 136s (1) cores
% 1.81/0.80  % Starting new_bool_1 with 136s (1) cores
% 1.81/0.80  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1 with pid 4143797 completed with status 0
% 1.81/0.80  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1
% 1.81/0.80  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.81/0.80  % No SInE strategy applied
% 1.81/0.80  % Search class: FHUNM-FFMS21-DFFFFFNN
% 1.81/0.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.80  % Starting SubtermCWHack with 136s (1) cores
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.81/0.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 1.81/0.80  % Preprocessing time       : 0.002 s
% 1.81/0.80  % Presaturation interreduction done
% 1.81/0.80  
% 1.81/0.80  % Proof found!
% 1.81/0.80  % SZS status Unsatisfiable
% 1.81/0.80  % SZS output start CNFRefutation
% See solution above
% 1.81/0.80  % Parsed axioms                        : 29
% 1.81/0.80  % Removed by relevancy pruning/SinE    : 0
% 1.81/0.80  % Initial clauses                      : 29
% 1.81/0.80  % Removed in clause preprocessing      : 0
% 1.81/0.80  % Initial clauses in saturation        : 29
% 1.81/0.80  % Processed clauses                    : 897
% 1.81/0.80  % ...of these trivial                  : 71
% 1.81/0.80  % ...subsumed                          : 0
% 1.81/0.80  % ...remaining for further processing  : 826
% 1.81/0.80  % Other redundant clauses eliminated   : 0
% 1.81/0.80  % Clauses deleted for lack of memory   : 0
% 1.81/0.80  % Backward-subsumed                    : 0
% 1.81/0.80  % Backward-rewritten                   : 4
% 1.81/0.80  % Generated clauses                    : 10250
% 1.81/0.80  % ...of the previous two non-redundant : 9995
% 1.81/0.80  % ...aggressively subsumed             : 0
% 1.81/0.80  % Contextual simplify-reflections      : 0
% 1.81/0.80  % Paramodulations                      : 10250
% 1.81/0.80  % Factorizations                       : 0
% 1.81/0.80  % NegExts                              : 0
% 1.81/0.80  % Equation resolutions                 : 0
% 1.81/0.80  % Disequality decompositions           : 0
% 1.81/0.80  % Total rewrite steps                  : 332
% 1.81/0.80  % ...of those cached                   : 126
% 1.81/0.80  % Propositional unsat checks           : 0
% 1.81/0.80  %    Propositional check models        : 0
% 1.81/0.80  %    Propositional check unsatisfiable : 0
% 1.81/0.80  %    Propositional clauses             : 0
% 1.81/0.80  %    Propositional clauses after purity: 0
% 1.81/0.80  %    Propositional unsat core size     : 0
% 1.81/0.80  %    Propositional preprocessing time  : 0.000
% 1.81/0.80  %    Propositional encoding time       : 0.000
% 1.81/0.80  %    Propositional solver time         : 0.000
% 1.81/0.80  %    Success case prop preproc time    : 0.000
% 1.81/0.80  %    Success case prop encoding time   : 0.000
% 1.81/0.80  %    Success case prop solver time     : 0.000
% 1.81/0.80  % Current number of processed clauses  : 793
% 1.81/0.80  %    Positive orientable unit clauses  : 95
% 1.81/0.80  %    Positive unorientable unit clauses: 0
% 1.81/0.80  %    Negative unit clauses             : 1
% 1.81/0.80  %    Non-unit-clauses                  : 697
% 1.81/0.80  % Current number of unprocessed clauses: 9111
% 1.81/0.80  % ...number of literals in the above   : 16282
% 1.81/0.80  % Current number of archived formulas  : 0
% 1.81/0.80  % Current number of archived clauses   : 33
% 1.81/0.80  % Clause-clause subsumption calls (NU) : 168394
% 1.81/0.80  % Rec. Clause-clause subsumption calls : 136350
% 1.81/0.80  % Non-unit clause-clause subsumptions  : 0
% 1.81/0.80  % Unit Clause-clause subsumption calls : 4053
% 1.81/0.80  % Rewrite failures with RHS unbound    : 0
% 1.81/0.80  % BW rewrite match attempts            : 340
% 1.81/0.80  % BW rewrite match successes           : 4
% 1.81/0.80  % Condensation attempts                : 0
% 1.81/0.80  % Condensation successes               : 0
% 1.81/0.80  % Termbank termtop insertions          : 236469
% 1.81/0.80  % Search garbage collected termcells   : 78
% 1.81/0.80  
% 1.81/0.80  % -------------------------------------------------
% 1.81/0.80  % User time                : 0.180 s
% 1.81/0.80  % System time              : 0.020 s
% 1.81/0.80  % Total time               : 0.200 s
% 1.81/0.80  % Maximum resident set size: 3672 pages
% 1.81/0.80  
% 1.81/0.80  % -------------------------------------------------
% 1.81/0.80  % User time                : 0.931 s
% 1.81/0.80  % System time              : 0.082 s
% 1.81/0.80  % Total time               : 1.013 s
% 1.81/0.80  % Maximum resident set size: 4608 pages
% 1.81/0.80  % E exiting
%------------------------------------------------------------------------------