↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.11s 0.47s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   39 (  17 unt;   5 nHn;  30 RR)
%            Number of literals    :   95 (   0 equ;  57 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   64 (   0 sgn)

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

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

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

cnf(not_p11_22,negated_conjecture,
    ( ~ p9(f8(X2,X3),f6(X3))
    | ~ p9(f8(X2,X3),X2)
    | ~ p2(X3,f5(X1))
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_22) ).

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

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

cnf(p9_10,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f6(c14)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_10) ).

cnf(p9_21,negated_conjecture,
    ( ~ p2(X2,f5(X3))
    | ~ p9(c12,X1)
    | ~ p11(X3,c15)
    | p9(f8(X1,X2),f6(X2))
    | p9(f8(X1,X2),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_21) ).

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

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

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

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

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

cnf(c_0_13,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    c_0_11 ).

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

cnf(c_0_15,negated_conjecture,
    ( ~ p9(f8(X2,X3),f6(X3))
    | ~ p9(f8(X2,X3),X2)
    | ~ p2(X3,f5(X1))
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    inference(fof_simplification,[status(thm)],[not_p11_22]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p3(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    c_0_12 ).

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

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

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

cnf(c_0_20,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f6(c14)) ),
    inference(fof_simplification,[status(thm)],[p9_10]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p2(X2,f5(X3))
    | ~ p9(c12,X1)
    | ~ p11(X3,c15)
    | p9(f8(X1,X2),f6(X2))
    | p9(f8(X1,X2),X1) ),
    inference(fof_simplification,[status(thm)],[p9_21]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p9(f8(X2,X3),f6(X3))
    | ~ p9(f8(X2,X3),X2)
    | ~ p2(X3,f5(X1))
    | ~ p9(c12,X2)
    | ~ p11(X1,c15) ),
    c_0_15 ).

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

cnf(c_0_24,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p9(X1,X3)
    | p9(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    p3(f6(X1),f6(f5(X1))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p9(X1,c13)
    | p9(X1,f6(c14)) ),
    c_0_20 ).

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

cnf(c_0_28,negated_conjecture,
    ( ~ p2(X2,f5(X3))
    | ~ p9(c12,X1)
    | ~ p11(X3,c15)
    | p9(f8(X1,X2),f6(X2))
    | p9(f8(X1,X2),X1) ),
    c_0_21 ).

cnf(c_0_29,negated_conjecture,
    ( ~ p2(X2,f5(c14))
    | ~ p9(c12,X1)
    | ~ p9(f8(X1,X2),X1)
    | ~ p9(f8(X1,X2),f6(X2)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    p2(X1,X1),
    p2_4 ).

cnf(c_0_31,negated_conjecture,
    ( ~ p9(X1,f6(X2))
    | p9(X1,f6(f5(X2))) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    p9(c12,f6(c14)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p2(X2,f5(c14))
    | ~ p9(c12,X1)
    | p9(f8(X1,X2),X1)
    | p9(f8(X1,X2),f6(X2)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p9(f8(X1,f5(c14)),X1)
    | ~ p9(f8(X1,f5(c14)),f6(f5(c14))) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    p9(c12,f6(f5(c14))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ p9(c12,X1)
    | p9(f8(X1,f5(c14)),X1)
    | p9(f8(X1,f5(c14)),f6(f5(c14))) ),
    inference(spm,[status(thm)],[c_0_33,c_0_30]) ).

cnf(c_0_37,negated_conjecture,
    ~ p9(f8(f6(f5(c14)),f5(c14)),f6(f5(c14))),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN575-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n004.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 11:09:04 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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.11/0.47  % Version: 3.5.1
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47  % Starting sh5l with 300s (1) cores
% 0.11/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2991724 completed with status 0
% 0.11/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47  % No SInE strategy applied
% 0.11/0.47  % Search class: FGHNM-FFSF21-SFFFFFNN
% 0.11/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.47  % new_bool_3 with pid 2991733 completed with status 0
% 0.11/0.47  % Result found by new_bool_3
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47  % No SInE strategy applied
% 0.11/0.47  % Search class: FGHNM-FFSF21-SFFFFFNN
% 0.11/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.47  % Preprocessing time       : 0.001 s
% 0.11/0.47  % Presaturation interreduction done
% 0.11/0.47  
% 0.11/0.47  % Proof found!
% 0.11/0.47  % SZS status Unsatisfiable
% 0.11/0.47  % SZS output start CNFRefutation
% See solution above
% 0.11/0.47  % Parsed axioms                        : 22
% 0.11/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.47  % Initial clauses                      : 22
% 0.11/0.47  % Removed in clause preprocessing      : 0
% 0.11/0.47  % Initial clauses in saturation        : 22
% 0.11/0.47  % Processed clauses                    : 457
% 0.11/0.47  % ...of these trivial                  : 130
% 0.11/0.47  % ...subsumed                          : 0
% 0.11/0.47  % ...remaining for further processing  : 327
% 0.11/0.47  % Other redundant clauses eliminated   : 0
% 0.11/0.47  % Clauses deleted for lack of memory   : 0
% 0.11/0.47  % Backward-subsumed                    : 0
% 0.11/0.47  % Backward-rewritten                   : 0
% 0.11/0.47  % Generated clauses                    : 2187
% 0.11/0.47  % ...of the previous two non-redundant : 1258
% 0.11/0.47  % ...aggressively subsumed             : 0
% 0.11/0.47  % Contextual simplify-reflections      : 1
% 0.11/0.47  % Paramodulations                      : 2187
% 0.11/0.47  % Factorizations                       : 0
% 0.11/0.47  % NegExts                              : 0
% 0.11/0.47  % Equation resolutions                 : 0
% 0.11/0.47  % Disequality decompositions           : 0
% 0.11/0.47  % Total rewrite steps                  : 1027
% 0.11/0.47  % ...of those cached                   : 754
% 0.11/0.47  % Propositional unsat checks           : 0
% 0.11/0.47  %    Propositional check models        : 0
% 0.11/0.47  %    Propositional check unsatisfiable : 0
% 0.11/0.47  %    Propositional clauses             : 0
% 0.11/0.47  %    Propositional clauses after purity: 0
% 0.11/0.47  %    Propositional unsat core size     : 0
% 0.11/0.47  %    Propositional preprocessing time  : 0.000
% 0.11/0.47  %    Propositional encoding time       : 0.000
% 0.11/0.47  %    Propositional solver time         : 0.000
% 0.11/0.47  %    Success case prop preproc time    : 0.000
% 0.11/0.47  %    Success case prop encoding time   : 0.000
% 0.11/0.47  %    Success case prop solver time     : 0.000
% 0.11/0.47  % Current number of processed clauses  : 305
% 0.11/0.47  %    Positive orientable unit clauses  : 91
% 0.11/0.47  %    Positive unorientable unit clauses: 0
% 0.11/0.47  %    Negative unit clauses             : 2
% 0.11/0.47  %    Non-unit-clauses                  : 212
% 0.11/0.47  % Current number of unprocessed clauses: 845
% 0.11/0.47  % ...number of literals in the above   : 1399
% 0.11/0.47  % Current number of archived formulas  : 0
% 0.11/0.47  % Current number of archived clauses   : 22
% 0.11/0.47  % Clause-clause subsumption calls (NU) : 3963
% 0.11/0.47  % Rec. Clause-clause subsumption calls : 2747
% 0.11/0.47  % Non-unit clause-clause subsumptions  : 1
% 0.11/0.47  % Unit Clause-clause subsumption calls : 106
% 0.11/0.47  % Rewrite failures with RHS unbound    : 0
% 0.11/0.47  % BW rewrite match attempts            : 761
% 0.11/0.47  % BW rewrite match successes           : 0
% 0.11/0.47  % Condensation attempts                : 0
% 0.11/0.47  % Condensation successes               : 0
% 0.11/0.47  % Termbank termtop insertions          : 45733
% 0.11/0.47  % Search garbage collected termcells   : 75
% 0.11/0.47  
% 0.11/0.47  % -------------------------------------------------
% 0.11/0.47  % User time                : 0.040 s
% 0.11/0.47  % System time              : 0.004 s
% 0.11/0.47  % Total time               : 0.044 s
% 0.11/0.47  % Maximum resident set size: 3648 pages
% 0.11/0.47  
% 0.11/0.47  % -------------------------------------------------
% 0.11/0.47  % User time                : 0.186 s
% 0.11/0.47  % System time              : 0.020 s
% 0.11/0.47  % Total time               : 0.206 s
% 0.11/0.47  % Maximum resident set size: 4608 pages
% 0.11/0.47  % E exiting
%------------------------------------------------------------------------------