↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.12s 0.49s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   47 (  21 unt;   0 nHn;  47 RR)
%            Number of literals    :   89 (   0 equ;  49 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   55 (  16 sgn)

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

cnf(rule_159,axiom,
    ( ~ k1(X1)
    | p2(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_159) ).

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

cnf(rule_240,axiom,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).

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

cnf(rule_304,axiom,
    ( ~ k4(X1)
    | m5(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_304) ).

cnf(rule_255,axiom,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).

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

cnf(rule_274,axiom,
    ( ~ n3(e)
    | ~ q3(e,b)
    | ~ n0(c,d)
    | k4(c) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).

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

cnf(rule_003,axiom,
    ( ~ m0(X2,X1,X3)
    | ~ r0(X4)
    | ~ p0(X3,X1)
    | l1(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).

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

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

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).

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

cnf(c_0_15,plain,
    ( ~ k1(X1)
    | p2(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_159]) ).

cnf(c_0_16,plain,
    ( ~ n0(X2,X1)
    | k1(X1) ),
    c_0_14 ).

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

cnf(c_0_18,plain,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    inference(fof_simplification,[status(thm)],[rule_240]) ).

cnf(c_0_19,plain,
    ( ~ k1(X1)
    | p2(X1,X1,X1) ),
    c_0_15 ).

cnf(c_0_20,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

cnf(c_0_22,plain,
    ( ~ k4(X1)
    | m5(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_304]) ).

cnf(c_0_23,plain,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_255]) ).

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

cnf(c_0_25,plain,
    ( ~ n3(e)
    | ~ q3(e,b)
    | ~ n0(c,d)
    | k4(c) ),
    inference(fof_simplification,[status(thm)],[rule_274]) ).

cnf(c_0_26,plain,
    ( ~ p2(X2,X3,X1)
    | n3(X1) ),
    c_0_18 ).

cnf(c_0_27,plain,
    p2(e,e,e),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    ~ m5(c,X1),
    c_0_21 ).

cnf(c_0_29,plain,
    ( ~ k4(X1)
    | m5(X1,X1) ),
    c_0_22 ).

cnf(c_0_30,plain,
    ( ~ n0(X3,X1)
    | ~ q2(X3,X1,X2)
    | q3(X1,X2) ),
    c_0_23 ).

cnf(c_0_31,plain,
    ( ~ l1(X2,X1)
    | q2(X1,X1,X2) ),
    c_0_24 ).

cnf(c_0_32,plain,
    ( ~ n3(e)
    | ~ q3(e,b)
    | ~ n0(c,d)
    | k4(c) ),
    c_0_25 ).

cnf(c_0_33,plain,
    n3(e),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,axiom,
    n0(c,d),
    axiom_34 ).

cnf(c_0_35,negated_conjecture,
    ~ k4(c),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    ( ~ n0(X1,X1)
    | ~ l1(X2,X1)
    | q3(X1,X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ m0(X2,X1,X3)
    | ~ r0(X4)
    | ~ p0(X3,X1)
    | l1(X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_003]) ).

cnf(c_0_38,plain,
    ~ q3(e,b),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).

cnf(c_0_39,plain,
    ( ~ l1(X1,e)
    | q3(e,X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_17]) ).

cnf(c_0_40,plain,
    ( ~ m0(X2,X1,X3)
    | ~ r0(X4)
    | ~ p0(X3,X1)
    | l1(X1,X2) ),
    c_0_37 ).

cnf(c_0_41,axiom,
    m0(e,b,c),
    axiom_27 ).

cnf(c_0_42,axiom,
    p0(c,b),
    axiom_18 ).

cnf(c_0_43,plain,
    ~ l1(b,e),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,axiom,
    r0(e),
    axiom_13 ).

cnf(c_0_45,plain,
    ~ r0(X1),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).

cnf(c_0_46,plain,
    $false,
    inference(sr,[status(thm)],[c_0_44,c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN141-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.12/0.37  % Computer : n004.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 10:44:35 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/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.12/0.49  % Version: 3.5.1
% 0.12/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.49  % Starting sh5l with 300s (1) cores
% 0.12/0.49  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2944318 completed with status 0
% 0.12/0.49  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.49  % No SInE strategy applied
% 0.12/0.49  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.49  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.49  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.12/0.49  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.49  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.49  % Starting new_bool_1 with 136s (1) cores
% 0.12/0.49  % SubtermCWHack with pid 2944341 completed with status 0
% 0.12/0.49  % Result found by SubtermCWHack
% 0.12/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.49  % No SInE strategy applied
% 0.12/0.49  % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.49  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.49  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.49  % Preprocessing time       : 0.005 s
% 0.12/0.49  
% 0.12/0.49  % Proof found!
% 0.12/0.49  % SZS status Unsatisfiable
% 0.12/0.49  % SZS output start CNFRefutation
% See solution above
% 0.12/0.49  % Parsed axioms                        : 369
% 0.12/0.49  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.49  % Initial clauses                      : 369
% 0.12/0.49  % Removed in clause preprocessing      : 7
% 0.12/0.49  % Initial clauses in saturation        : 362
% 0.12/0.49  % Processed clauses                    : 584
% 0.12/0.49  % ...of these trivial                  : 81
% 0.12/0.49  % ...subsumed                          : 11
% 0.12/0.49  % ...remaining for further processing  : 492
% 0.12/0.49  % Other redundant clauses eliminated   : 0
% 0.12/0.49  % Clauses deleted for lack of memory   : 0
% 0.12/0.49  % Backward-subsumed                    : 51
% 0.12/0.49  % Backward-rewritten                   : 177
% 0.12/0.49  % Generated clauses                    : 540
% 0.12/0.49  % ...of the previous two non-redundant : 381
% 0.12/0.49  % ...aggressively subsumed             : 0
% 0.12/0.49  % Contextual simplify-reflections      : 0
% 0.12/0.49  % Paramodulations                      : 538
% 0.12/0.49  % Factorizations                       : 0
% 0.12/0.49  % NegExts                              : 0
% 0.12/0.49  % Equation resolutions                 : 0
% 0.12/0.49  % Disequality decompositions           : 0
% 0.12/0.49  % Total rewrite steps                  : 558
% 0.12/0.49  % ...of those cached                   : 317
% 0.12/0.49  % Propositional unsat checks           : 0
% 0.12/0.49  %    Propositional check models        : 0
% 0.12/0.49  %    Propositional check unsatisfiable : 0
% 0.12/0.49  %    Propositional clauses             : 0
% 0.12/0.49  %    Propositional clauses after purity: 0
% 0.12/0.49  %    Propositional unsat core size     : 0
% 0.12/0.49  %    Propositional preprocessing time  : 0.000
% 0.12/0.49  %    Propositional encoding time       : 0.000
% 0.12/0.49  %    Propositional solver time         : 0.000
% 0.12/0.49  %    Success case prop preproc time    : 0.000
% 0.12/0.49  %    Success case prop encoding time   : 0.000
% 0.12/0.49  %    Success case prop solver time     : 0.000
% 0.12/0.49  % Current number of processed clauses  : 262
% 0.12/0.49  %    Positive orientable unit clauses  : 148
% 0.12/0.49  %    Positive unorientable unit clauses: 0
% 0.12/0.49  %    Negative unit clauses             : 5
% 0.12/0.49  %    Non-unit-clauses                  : 109
% 0.12/0.49  % Current number of unprocessed clauses: 113
% 0.12/0.49  % ...number of literals in the above   : 423
% 0.12/0.49  % Current number of archived formulas  : 0
% 0.12/0.49  % Current number of archived clauses   : 230
% 0.12/0.49  % Clause-clause subsumption calls (NU) : 6548
% 0.12/0.49  % Rec. Clause-clause subsumption calls : 5688
% 0.12/0.49  % Non-unit clause-clause subsumptions  : 30
% 0.12/0.49  % Unit Clause-clause subsumption calls : 1224
% 0.12/0.49  % Rewrite failures with RHS unbound    : 0
% 0.12/0.49  % BW rewrite match attempts            : 237
% 0.12/0.49  % BW rewrite match successes           : 148
% 0.12/0.49  % Condensation attempts                : 0
% 0.12/0.49  % Condensation successes               : 0
% 0.12/0.49  % Termbank termtop insertions          : 17747
% 0.12/0.49  % Search garbage collected termcells   : 1461
% 0.12/0.49  
% 0.12/0.49  % -------------------------------------------------
% 0.12/0.49  % User time                : 0.034 s
% 0.12/0.49  % System time              : 0.009 s
% 0.12/0.49  % Total time               : 0.043 s
% 0.12/0.49  % Maximum resident set size: 4216 pages
% 0.12/0.49  
% 0.12/0.49  % -------------------------------------------------
% 0.12/0.49  % User time                : 0.107 s
% 0.12/0.49  % System time              : 0.030 s
% 0.12/0.49  % Total time               : 0.136 s
% 0.12/0.49  % Maximum resident set size: 4864 pages
% 0.12/0.49  % E exiting
%------------------------------------------------------------------------------