↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.16s 0.79s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (  15 unt;   0 nHn;  27 RR)
%            Number of literals    :   58 (   0 equ;  29 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   43 (  17 sgn)

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

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

cnf(rule_189,axiom,
    ( ~ s1(b)
    | ~ q2(b,X1,b)
    | s2(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).

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

cnf(rule_186,axiom,
    ( ~ l1(X2,X1)
    | q2(X1,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_186) ).

cnf(axiom_15,axiom,
    n0(a,b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_15) ).

cnf(rule_273,axiom,
    ( ~ m0(X3,X4,X2)
    | ~ s2(X1)
    | ~ q2(X3,X1,X3)
    | s3(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).

cnf(prove_this,negated_conjecture,
    ~ s3(X1,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

cnf(c_0_11,plain,
    ( ~ s1(b)
    | ~ q2(b,X1,b)
    | s2(X1) ),
    inference(fof_simplification,[status(thm)],[rule_189]) ).

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

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

cnf(c_0_14,plain,
    ( ~ l1(X2,X1)
    | q2(X1,X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_186]) ).

cnf(c_0_15,plain,
    ( ~ n0(X2,X1)
    | l1(X1,X1) ),
    c_0_10 ).

cnf(c_0_16,axiom,
    n0(a,b),
    axiom_15 ).

cnf(c_0_17,plain,
    ( ~ s1(b)
    | ~ q2(b,X1,b)
    | s2(X1) ),
    c_0_11 ).

cnf(c_0_18,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ l1(X2,X1)
    | q2(X1,X1,X2) ),
    c_0_14 ).

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

cnf(c_0_21,plain,
    ( ~ m0(X3,X4,X2)
    | ~ s2(X1)
    | ~ q2(X3,X1,X3)
    | s3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_273]) ).

cnf(c_0_22,plain,
    ( ~ q2(b,X1,b)
    | s2(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_23,plain,
    q2(b,b,b),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ m0(X3,X4,X2)
    | ~ s2(X1)
    | ~ q2(X3,X1,X3)
    | s3(X1,X2) ),
    c_0_21 ).

cnf(c_0_25,plain,
    s2(b),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ s3(X1,b),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_27,plain,
    ( ~ m0(b,X2,X1)
    | s3(b,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_25])]) ).

cnf(c_0_28,axiom,
    m0(X1,d,X2),
    axiom_19 ).

cnf(c_0_29,negated_conjecture,
    ~ s3(X1,b),
    c_0_26 ).

cnf(c_0_30,plain,
    s3(b,X1),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_29,c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN203-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.11/0.64  % Computer : n015.cluster.edu
% 0.11/0.64  % Model    : x86_64 x86_64
% 0.11/0.64  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.64  % Memory   : 8046.5625MB
% 0.11/0.64  % OS       : Linux 6.8.0-71-generic
% 0.11/0.64  % CPULimit : 300
% 0.11/0.64  % WCLimit  : 300
% 0.11/0.64  % DateTime : Mon Sep 21 10:49:06 UTC 2026
% 0.11/0.64  % CPUTime  : 
% 0.11/0.64  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.68  Running first-order theorem proving
% 0.11/0.68  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.16/0.79  % Version: 3.5.1
% 0.16/0.79  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.79  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.79  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.79  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.79  % Starting sh5l with 300s (1) cores
% 0.16/0.79  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1278205 completed with status 0
% 0.16/0.79  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.79  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.79  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.79  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.79  % No SInE strategy applied
% 0.16/0.79  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/0.79  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.79  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.79  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.79  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.79  % Starting new_bool_3 with 136s (1) cores
% 0.16/0.79  % Starting new_bool_1 with 136s (1) cores
% 0.16/0.79  % new_bool_1 with pid 1278217 completed with status 0
% 0.16/0.79  % Result found by new_bool_1
% 0.16/0.79  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.79  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.79  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.79  % No SInE strategy applied
% 0.16/0.79  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/0.79  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.79  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.79  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.79  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.79  % Starting new_bool_3 with 136s (1) cores
% 0.16/0.79  % Starting new_bool_1 with 136s (1) cores
% 0.16/0.79  % Preprocessing time       : 0.005 s
% 0.16/0.79  % Presaturation interreduction done
% 0.16/0.79  
% 0.16/0.79  % Proof found!
% 0.16/0.79  % SZS status Unsatisfiable
% 0.16/0.79  % SZS output start CNFRefutation
% See solution above
% 0.16/0.79  % Parsed axioms                        : 369
% 0.16/0.79  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.79  % Initial clauses                      : 369
% 0.16/0.79  % Removed in clause preprocessing      : 7
% 0.16/0.79  % Initial clauses in saturation        : 362
% 0.16/0.79  % Processed clauses                    : 784
% 0.16/0.79  % ...of these trivial                  : 25
% 0.16/0.79  % ...subsumed                          : 25
% 0.16/0.79  % ...remaining for further processing  : 734
% 0.16/0.79  % Other redundant clauses eliminated   : 0
% 0.16/0.79  % Clauses deleted for lack of memory   : 0
% 0.16/0.79  % Backward-subsumed                    : 13
% 0.16/0.79  % Backward-rewritten                   : 50
% 0.16/0.79  % Generated clauses                    : 614
% 0.16/0.79  % ...of the previous two non-redundant : 447
% 0.16/0.79  % ...aggressively subsumed             : 0
% 0.16/0.79  % Contextual simplify-reflections      : 2
% 0.16/0.79  % Paramodulations                      : 614
% 0.16/0.79  % Factorizations                       : 0
% 0.16/0.79  % NegExts                              : 0
% 0.16/0.79  % Equation resolutions                 : 0
% 0.16/0.79  % Disequality decompositions           : 0
% 0.16/0.79  % Total rewrite steps                  : 401
% 0.16/0.79  % ...of those cached                   : 261
% 0.16/0.79  % Propositional unsat checks           : 0
% 0.16/0.79  %    Propositional check models        : 0
% 0.16/0.79  %    Propositional check unsatisfiable : 0
% 0.16/0.79  %    Propositional clauses             : 0
% 0.16/0.79  %    Propositional clauses after purity: 0
% 0.16/0.79  %    Propositional unsat core size     : 0
% 0.16/0.79  %    Propositional preprocessing time  : 0.000
% 0.16/0.79  %    Propositional encoding time       : 0.000
% 0.16/0.79  %    Propositional solver time         : 0.000
% 0.16/0.79  %    Success case prop preproc time    : 0.000
% 0.16/0.79  %    Success case prop encoding time   : 0.000
% 0.16/0.79  %    Success case prop solver time     : 0.000
% 0.16/0.79  % Current number of processed clauses  : 343
% 0.16/0.79  %    Positive orientable unit clauses  : 132
% 0.16/0.79  %    Positive unorientable unit clauses: 0
% 0.16/0.79  %    Negative unit clauses             : 1
% 0.16/0.79  %    Non-unit-clauses                  : 210
% 0.16/0.79  % Current number of unprocessed clauses: 338
% 0.16/0.79  % ...number of literals in the above   : 823
% 0.16/0.79  % Current number of archived formulas  : 0
% 0.16/0.79  % Current number of archived clauses   : 391
% 0.16/0.79  % Clause-clause subsumption calls (NU) : 36889
% 0.16/0.79  % Rec. Clause-clause subsumption calls : 26564
% 0.16/0.79  % Non-unit clause-clause subsumptions  : 36
% 0.16/0.79  % Unit Clause-clause subsumption calls : 573
% 0.16/0.79  % Rewrite failures with RHS unbound    : 0
% 0.16/0.79  % BW rewrite match attempts            : 92
% 0.16/0.79  % BW rewrite match successes           : 44
% 0.16/0.79  % Condensation attempts                : 0
% 0.16/0.79  % Condensation successes               : 0
% 0.16/0.79  % Termbank termtop insertions          : 20892
% 0.16/0.79  % Search garbage collected termcells   : 1461
% 0.16/0.79  
% 0.16/0.79  % -------------------------------------------------
% 0.16/0.79  % User time                : 0.060 s
% 0.16/0.79  % System time              : 0.005 s
% 0.16/0.79  % Total time               : 0.065 s
% 0.16/0.79  % Maximum resident set size: 4472 pages
% 0.16/0.79  
% 0.16/0.79  % -------------------------------------------------
% 0.16/0.79  % User time                : 0.306 s
% 0.16/0.79  % System time              : 0.027 s
% 0.16/0.79  % Total time               : 0.333 s
% 0.16/0.79  % Maximum resident set size: 4864 pages
% 0.16/0.79  % E exiting
%------------------------------------------------------------------------------