↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN221-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.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:23:25 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.46s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  16 unt;   0 nHn;  32 RR)
%            Number of literals    :   61 (   0 equ;  30 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   31 (  18 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).

cnf(rule_125,axiom,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(rule_190,axiom,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).

cnf(axiom_36,axiom,
    q0(a,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

cnf(rule_220,axiom,
    ( ~ l1(X1,X1)
    | ~ s2(X2)
    | l3(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_220) ).

cnf(rule_002,axiom,
    ( ~ n0(X2,X1)
    | l1(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).

cnf(prove_this,negated_conjecture,
    ~ l3(X1,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(axiom_26,axiom,
    n0(d,c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).

cnf(c_0_10,plain,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_126]) ).

cnf(c_0_11,plain,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_125]) ).

cnf(c_0_12,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    inference(fof_simplification,[status(thm)],[rule_190]) ).

cnf(c_0_13,plain,
    ( ~ s1(X3)
    | ~ q0(X1,X2)
    | s1(X1) ),
    c_0_10 ).

cnf(c_0_14,axiom,
    q0(a,b),
    axiom_36 ).

cnf(c_0_15,plain,
    ( ~ p0(X1,X1)
    | s1(X1) ),
    c_0_11 ).

cnf(c_0_16,axiom,
    p0(b,X1),
    axiom_14 ).

cnf(c_0_17,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    c_0_12 ).

cnf(c_0_18,axiom,
    s0(d),
    axiom_1 ).

cnf(c_0_19,plain,
    ( ~ s1(X1)
    | s1(a) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ l1(X1,X1)
    | ~ s2(X2)
    | l3(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_220]) ).

cnf(c_0_22,plain,
    ( ~ s1(a)
    | s2(d) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_23,plain,
    s1(a),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ n0(X2,X1)
    | l1(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_002]) ).

cnf(c_0_25,negated_conjecture,
    ~ l3(X1,c),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_26,plain,
    ( ~ l1(X1,X1)
    | ~ s2(X2)
    | l3(X1,X1) ),
    c_0_21 ).

cnf(c_0_27,plain,
    s2(d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).

cnf(c_0_28,plain,
    ( ~ n0(X2,X1)
    | l1(X1,X1) ),
    c_0_24 ).

cnf(c_0_29,axiom,
    n0(d,c),
    axiom_26 ).

cnf(c_0_30,negated_conjecture,
    ~ l3(X1,c),
    c_0_25 ).

cnf(c_0_31,plain,
    ( ~ l1(X1,X1)
    | l3(X1,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,plain,
    l1(c,c),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN221-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 10:44:06 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  Running first-order theorem proving
% 0.15/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.15/0.46  % Version: 3.5.1
% 0.15/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46  % Starting sh5l with 300s (1) cores
% 0.15/0.46  % new_bool_3 with pid 886186 completed with status 0
% 0.15/0.46  % Result found by new_bool_3
% 0.15/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46  % SubtermCWHack with pid 886192 completed with status 0
% 0.15/0.46  % Result found by SubtermCWHack
% 0.15/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46  % Preprocessing time       : 0.003 s
% 0.15/0.46  
% 0.15/0.46  % Proof found!
% 0.15/0.46  % SZS status Unsatisfiable
% 0.15/0.46  % SZS output start CNFRefutation
% See solution above
% 0.15/0.46  % Parsed axioms                        : 369
% 0.15/0.46  % Removed by relevancy pruning/SinE    : 30
% 0.15/0.46  % Initial clauses                      : 339
% 0.15/0.46  % Removed in clause preprocessing      : 6
% 0.15/0.46  % Initial clauses in saturation        : 333
% 0.15/0.46  % Processed clauses                    : 153
% 0.15/0.46  % ...of these trivial                  : 9
% 0.15/0.46  % ...subsumed                          : 2
% 0.15/0.46  % ...remaining for further processing  : 142
% 0.15/0.46  % Other redundant clauses eliminated   : 0
% 0.15/0.46  % Clauses deleted for lack of memory   : 0
% 0.15/0.46  % Backward-subsumed                    : 5
% 0.15/0.46  % Backward-rewritten                   : 22
% 0.15/0.46  % Generated clauses                    : 81
% 0.15/0.46  % ...of the previous two non-redundant : 80
% 0.15/0.46  % ...aggressively subsumed             : 0
% 0.15/0.46  % Contextual simplify-reflections      : 0
% 0.15/0.46  % Paramodulations                      : 81
% 0.15/0.46  % Factorizations                       : 0
% 0.15/0.46  % NegExts                              : 0
% 0.15/0.46  % Equation resolutions                 : 0
% 0.15/0.46  % Disequality decompositions           : 0
% 0.15/0.46  % Total rewrite steps                  : 50
% 0.15/0.46  % ...of those cached                   : 16
% 0.15/0.46  % Propositional unsat checks           : 0
% 0.15/0.46  %    Propositional check models        : 0
% 0.15/0.46  %    Propositional check unsatisfiable : 0
% 0.15/0.46  %    Propositional clauses             : 0
% 0.15/0.46  %    Propositional clauses after purity: 0
% 0.15/0.46  %    Propositional unsat core size     : 0
% 0.15/0.46  %    Propositional preprocessing time  : 0.000
% 0.15/0.46  %    Propositional encoding time       : 0.000
% 0.15/0.46  %    Propositional solver time         : 0.000
% 0.15/0.46  %    Success case prop preproc time    : 0.000
% 0.15/0.46  %    Success case prop encoding time   : 0.000
% 0.15/0.46  %    Success case prop solver time     : 0.000
% 0.15/0.46  % Current number of processed clauses  : 115
% 0.15/0.46  %    Positive orientable unit clauses  : 82
% 0.15/0.46  %    Positive unorientable unit clauses: 0
% 0.15/0.46  %    Negative unit clauses             : 5
% 0.15/0.46  %    Non-unit-clauses                  : 28
% 0.15/0.46  % Current number of unprocessed clauses: 252
% 0.15/0.46  % ...number of literals in the above   : 816
% 0.15/0.46  % Current number of archived formulas  : 0
% 0.15/0.46  % Current number of archived clauses   : 27
% 0.15/0.46  % Clause-clause subsumption calls (NU) : 378
% 0.15/0.46  % Rec. Clause-clause subsumption calls : 332
% 0.15/0.46  % Non-unit clause-clause subsumptions  : 5
% 0.15/0.46  % Unit Clause-clause subsumption calls : 32
% 0.15/0.46  % Rewrite failures with RHS unbound    : 0
% 0.15/0.46  % BW rewrite match attempts            : 22
% 0.15/0.46  % BW rewrite match successes           : 20
% 0.15/0.46  % Condensation attempts                : 0
% 0.15/0.46  % Condensation successes               : 0
% 0.15/0.46  % Termbank termtop insertions          : 12106
% 0.15/0.46  % Search garbage collected termcells   : 1503
% 0.15/0.46  
% 0.15/0.46  % -------------------------------------------------
% 0.15/0.46  % User time                : 0.013 s
% 0.15/0.46  % System time              : 0.003 s
% 0.15/0.46  % Total time               : 0.016 s
% 0.15/0.46  % Maximum resident set size: 4472 pages
% 0.15/0.46  
% 0.15/0.46  % -------------------------------------------------
% 0.15/0.46  % User time                : 0.022 s
% 0.15/0.46  % System time              : 0.006 s
% 0.15/0.46  % Total time               : 0.028 s
% 0.15/0.46  % Maximum resident set size: 4864 pages
% 0.15/0.46  % E exiting
%------------------------------------------------------------------------------