↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN176-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:23:18 PM UTC 2026

% Result   : Unsatisfiable 0.12s 0.47s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   37 (  18 unt;   0 nHn;  31 RR)
%            Number of literals    :   73 (   0 equ;  39 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   53 (  24 sgn)

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

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

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

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

cnf(rule_133,axiom,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).

cnf(rule_183,axiom,
    ( ~ l2(X2,X1)
    | ~ l0(c)
    | ~ k1(X2)
    | q2(X1,c,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).

cnf(axiom_31,axiom,
    m0(b,b,e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).

cnf(rule_001,axiom,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(axiom_24,axiom,
    l0(c),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).

cnf(prove_this,negated_conjecture,
    ~ q2(e,c,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

cnf(c_0_14,axiom,
    q0(X1,d),
    axiom_17 ).

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

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

cnf(c_0_17,plain,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_133]) ).

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

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

cnf(c_0_20,plain,
    ( ~ m0(X4,X3,X1)
    | ~ s1(X3)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    c_0_17 ).

cnf(c_0_21,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( ~ l2(X2,X1)
    | ~ l0(c)
    | ~ k1(X2)
    | q2(X1,c,X2) ),
    inference(fof_simplification,[status(thm)],[rule_183]) ).

cnf(c_0_23,plain,
    ( ~ m0(X3,X4,X1)
    | ~ p0(X2,X2)
    | l2(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_24,axiom,
    m0(b,b,e),
    axiom_31 ).

cnf(c_0_25,plain,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    inference(fof_simplification,[status(thm)],[rule_001]) ).

cnf(c_0_26,plain,
    ( ~ l2(X2,X1)
    | ~ l0(c)
    | ~ k1(X2)
    | q2(X1,c,X2) ),
    c_0_22 ).

cnf(c_0_27,axiom,
    l0(c),
    axiom_24 ).

cnf(c_0_28,plain,
    ( ~ p0(X1,X1)
    | l2(e,e) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    c_0_25 ).

cnf(c_0_30,axiom,
    n0(e,e),
    axiom_30 ).

cnf(c_0_31,negated_conjecture,
    ~ q2(e,c,X1),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_32,plain,
    ( ~ k1(X2)
    | ~ l2(X2,X1)
    | q2(X1,c,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

cnf(c_0_33,plain,
    l2(e,e),
    inference(spm,[status(thm)],[c_0_28,c_0_16]) ).

cnf(c_0_34,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    ~ q2(e,c,X1),
    c_0_31 ).

cnf(c_0_36,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN176-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 10:48:21 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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
% 0.12/0.47  % Version: 3.5.1
% 0.12/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47  % Starting sh5l with 300s (1) cores
% 0.12/0.47  % new_bool_1 with pid 2072082 completed with status 0
% 0.12/0.47  % Result found by new_bool_1
% 0.12/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.47  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47  % SubtermCWHack with pid 2072086 completed with status 0
% 0.12/0.47  % Result found by SubtermCWHack
% 0.12/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.47  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47  % Preprocessing time       : 0.003 s
% 0.12/0.47  
% 0.12/0.47  % Proof found!
% 0.12/0.47  % SZS status Unsatisfiable
% 0.12/0.47  % SZS output start CNFRefutation
% See solution above
% 0.12/0.47  % Parsed axioms                        : 369
% 0.12/0.47  % Removed by relevancy pruning/SinE    : 60
% 0.12/0.47  % Initial clauses                      : 309
% 0.12/0.47  % Removed in clause preprocessing      : 5
% 0.12/0.47  % Initial clauses in saturation        : 304
% 0.12/0.47  % Processed clauses                    : 524
% 0.12/0.47  % ...of these trivial                  : 81
% 0.12/0.47  % ...subsumed                          : 7
% 0.12/0.47  % ...remaining for further processing  : 436
% 0.12/0.47  % Other redundant clauses eliminated   : 0
% 0.12/0.47  % Clauses deleted for lack of memory   : 0
% 0.12/0.47  % Backward-subsumed                    : 32
% 0.12/0.47  % Backward-rewritten                   : 154
% 0.12/0.47  % Generated clauses                    : 536
% 0.12/0.47  % ...of the previous two non-redundant : 359
% 0.12/0.47  % ...aggressively subsumed             : 0
% 0.12/0.47  % Contextual simplify-reflections      : 1
% 0.12/0.47  % Paramodulations                      : 536
% 0.12/0.47  % Factorizations                       : 0
% 0.12/0.47  % NegExts                              : 0
% 0.12/0.47  % Equation resolutions                 : 0
% 0.12/0.47  % Disequality decompositions           : 0
% 0.12/0.47  % Total rewrite steps                  : 538
% 0.12/0.47  % ...of those cached                   : 313
% 0.12/0.47  % Propositional unsat checks           : 0
% 0.12/0.47  %    Propositional check models        : 0
% 0.12/0.47  %    Propositional check unsatisfiable : 0
% 0.12/0.47  %    Propositional clauses             : 0
% 0.12/0.47  %    Propositional clauses after purity: 0
% 0.12/0.47  %    Propositional unsat core size     : 0
% 0.12/0.47  %    Propositional preprocessing time  : 0.000
% 0.12/0.47  %    Propositional encoding time       : 0.000
% 0.12/0.47  %    Propositional solver time         : 0.000
% 0.12/0.47  %    Success case prop preproc time    : 0.000
% 0.12/0.47  %    Success case prop encoding time   : 0.000
% 0.12/0.47  %    Success case prop solver time     : 0.000
% 0.12/0.47  % Current number of processed clauses  : 250
% 0.12/0.47  %    Positive orientable unit clauses  : 138
% 0.12/0.47  %    Positive unorientable unit clauses: 0
% 0.12/0.47  %    Negative unit clauses             : 2
% 0.12/0.47  %    Non-unit-clauses                  : 110
% 0.12/0.47  % Current number of unprocessed clauses: 89
% 0.12/0.47  % ...number of literals in the above   : 326
% 0.12/0.47  % Current number of archived formulas  : 0
% 0.12/0.47  % Current number of archived clauses   : 186
% 0.12/0.47  % Clause-clause subsumption calls (NU) : 5076
% 0.12/0.47  % Rec. Clause-clause subsumption calls : 4478
% 0.12/0.47  % Non-unit clause-clause subsumptions  : 32
% 0.12/0.47  % Unit Clause-clause subsumption calls : 611
% 0.12/0.47  % Rewrite failures with RHS unbound    : 0
% 0.12/0.47  % BW rewrite match attempts            : 238
% 0.12/0.47  % BW rewrite match successes           : 133
% 0.12/0.47  % Condensation attempts                : 0
% 0.12/0.47  % Condensation successes               : 0
% 0.12/0.47  % Termbank termtop insertions          : 16247
% 0.12/0.47  % Search garbage collected termcells   : 1540
% 0.12/0.47  
% 0.12/0.47  % -------------------------------------------------
% 0.12/0.47  % User time                : 0.019 s
% 0.12/0.47  % System time              : 0.005 s
% 0.12/0.47  % Total time               : 0.025 s
% 0.12/0.47  % Maximum resident set size: 4472 pages
% 0.12/0.47  
% 0.12/0.47  % -------------------------------------------------
% 0.12/0.47  % User time                : 0.023 s
% 0.12/0.47  % System time              : 0.009 s
% 0.12/0.47  % Total time               : 0.032 s
% 0.12/0.47  % Maximum resident set size: 5120 pages
% 0.12/0.47  % E exiting
%------------------------------------------------------------------------------