↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   23 (  14 unt;   0 nHn;  12 RR)
%            Number of literals    :   38 (   0 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn)

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

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

cnf(p10_32,negated_conjecture,
    ( ~ p5(X1,X3)
    | ~ p10(X2,X4)
    | p10(f13(X1,X2),f13(X3,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10_32) ).

cnf(p10_26,negated_conjecture,
    p10(f13(f6(c22),X1),f13(f6(c24),f16(c26,X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10_26) ).

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

cnf(p10_11,negated_conjecture,
    p10(f16(X1,f14(f15(f7(c25)))),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10_11) ).

cnf(not_p10_28,negated_conjecture,
    ~ p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p10_28) ).

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

cnf(c_0_8,negated_conjecture,
    ( ~ p10(X3,X2)
    | ~ p10(X3,X1)
    | p10(X1,X2) ),
    c_0_7 ).

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

cnf(c_0_10,negated_conjecture,
    ( ~ p5(X1,X3)
    | ~ p10(X2,X4)
    | p10(f13(X1,X2),f13(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p10_32]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p10(X2,X1)
    | p10(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    p10(f13(f6(c22),X1),f13(f6(c24),f16(c26,X1))),
    p10_26 ).

cnf(c_0_13,negated_conjecture,
    ( ~ p5(X1,X3)
    | ~ p10(X2,X4)
    | p10(f13(X1,X2),f13(X3,X4)) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    p5(X1,X1),
    p5_2 ).

cnf(c_0_15,negated_conjecture,
    p10(f13(f6(c24),f16(c26,X1)),f13(f6(c22),X1)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_17,negated_conjecture,
    p10(f16(X1,f14(f15(f7(c25)))),X1),
    p10_11 ).

cnf(c_0_18,negated_conjecture,
    ~ p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))),
    inference(fof_simplification,[status(thm)],[not_p10_28]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p10(f13(f6(c24),f16(c26,X2)),X1)
    | p10(X1,f13(f6(c22),X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    p10(f13(X1,f16(X2,f14(f15(f7(c25))))),f13(X1,X2)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ~ p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))),
    c_0_18 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN624-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.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 11:09:58 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/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.10/0.45  % Version: 3.5.1
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % Starting sh5l with 300s (1) cores
% 0.10/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1598496 completed with status 0
% 0.10/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45  % new_bool_3 with pid 1598507 completed with status 0
% 0.10/0.45  % Result found by new_bool_3
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45  % Preprocessing time       : 0.002 s
% 0.10/0.45  % Presaturation interreduction done
% 0.10/0.45  
% 0.10/0.45  % Proof found!
% 0.10/0.45  % SZS status Unsatisfiable
% 0.10/0.45  % SZS output start CNFRefutation
% See solution above
% 0.10/0.45  % Parsed axioms                        : 35
% 0.10/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.45  % Initial clauses                      : 35
% 0.10/0.45  % Removed in clause preprocessing      : 0
% 0.10/0.45  % Initial clauses in saturation        : 35
% 0.10/0.45  % Processed clauses                    : 338
% 0.10/0.45  % ...of these trivial                  : 30
% 0.10/0.45  % ...subsumed                          : 2
% 0.10/0.45  % ...remaining for further processing  : 306
% 0.10/0.45  % Other redundant clauses eliminated   : 0
% 0.10/0.45  % Clauses deleted for lack of memory   : 0
% 0.10/0.45  % Backward-subsumed                    : 0
% 0.10/0.45  % Backward-rewritten                   : 0
% 0.10/0.45  % Generated clauses                    : 1162
% 0.10/0.45  % ...of the previous two non-redundant : 901
% 0.10/0.45  % ...aggressively subsumed             : 0
% 0.10/0.45  % Contextual simplify-reflections      : 0
% 0.10/0.45  % Paramodulations                      : 1162
% 0.10/0.45  % Factorizations                       : 0
% 0.10/0.45  % NegExts                              : 0
% 0.10/0.45  % Equation resolutions                 : 0
% 0.10/0.45  % Disequality decompositions           : 0
% 0.10/0.45  % Total rewrite steps                  : 288
% 0.10/0.45  % ...of those cached                   : 90
% 0.10/0.45  % Propositional unsat checks           : 0
% 0.10/0.45  %    Propositional check models        : 0
% 0.10/0.45  %    Propositional check unsatisfiable : 0
% 0.10/0.45  %    Propositional clauses             : 0
% 0.10/0.45  %    Propositional clauses after purity: 0
% 0.10/0.45  %    Propositional unsat core size     : 0
% 0.10/0.45  %    Propositional preprocessing time  : 0.000
% 0.10/0.45  %    Propositional encoding time       : 0.000
% 0.10/0.45  %    Propositional solver time         : 0.000
% 0.10/0.45  %    Success case prop preproc time    : 0.000
% 0.10/0.45  %    Success case prop encoding time   : 0.000
% 0.10/0.45  %    Success case prop solver time     : 0.000
% 0.10/0.45  % Current number of processed clauses  : 271
% 0.10/0.45  %    Positive orientable unit clauses  : 144
% 0.10/0.45  %    Positive unorientable unit clauses: 0
% 0.10/0.45  %    Negative unit clauses             : 4
% 0.10/0.45  %    Non-unit-clauses                  : 123
% 0.10/0.45  % Current number of unprocessed clauses: 631
% 0.10/0.45  % ...number of literals in the above   : 705
% 0.10/0.45  % Current number of archived formulas  : 0
% 0.10/0.45  % Current number of archived clauses   : 35
% 0.10/0.45  % Clause-clause subsumption calls (NU) : 1808
% 0.10/0.45  % Rec. Clause-clause subsumption calls : 1535
% 0.10/0.45  % Non-unit clause-clause subsumptions  : 2
% 0.10/0.45  % Unit Clause-clause subsumption calls : 283
% 0.10/0.45  % Rewrite failures with RHS unbound    : 0
% 0.10/0.45  % BW rewrite match attempts            : 371
% 0.10/0.45  % BW rewrite match successes           : 0
% 0.10/0.45  % Condensation attempts                : 0
% 0.10/0.45  % Condensation successes               : 0
% 0.10/0.45  % Termbank termtop insertions          : 19240
% 0.10/0.45  % Search garbage collected termcells   : 97
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.028 s
% 0.10/0.45  % System time              : 0.005 s
% 0.10/0.45  % Total time               : 0.033 s
% 0.10/0.45  % Maximum resident set size: 3668 pages
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.129 s
% 0.10/0.45  % System time              : 0.026 s
% 0.10/0.45  % Total time               : 0.155 s
% 0.10/0.45  % Maximum resident set size: 4864 pages
% 0.10/0.45  % E exiting
%------------------------------------------------------------------------------