↑ 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  : HWV009-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n018.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 12:48:44 PM UTC 2026

% Result   : Unsatisfiable 0.09s 5.58s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (   6 unt;   4 nHn;  18 RR)
%            Number of literals    :   37 (   9 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_26,axiom,
    ( ~ p_Reset(X1)
    | int_level(plus(X1,n1)) = n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_26) ).

cnf(quest_2,negated_conjecture,
    ( level(plus(t_139,n1)) != n0
    | p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

cnf(axiom_21,axiom,
    level(X1) = int_level(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

cnf(axiom_29,axiom,
    ( ~ p_Wr_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_29) ).

cnf(quest_1,negated_conjecture,
    p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(axiom_30,axiom,
    ( ~ p_Rd_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_30) ).

cnf(c_0_6,plain,
    ( ~ p_Reset(X1)
    | int_level(plus(X1,n1)) = n0 ),
    inference(fof_simplification,[status(thm)],[axiom_26]) ).

cnf(c_0_7,negated_conjecture,
    ( level(plus(t_139,n1)) != n0
    | p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1)) ),
    inference(fof_simplification,[status(thm)],[quest_2]) ).

cnf(c_0_8,plain,
    ( ~ p_Reset(X1)
    | int_level(plus(X1,n1)) = n0 ),
    c_0_6 ).

cnf(c_0_9,axiom,
    level(X1) = int_level(X1),
    axiom_21 ).

cnf(c_0_10,plain,
    ( ~ p_Wr_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_29]) ).

cnf(c_0_11,negated_conjecture,
    ( level(plus(t_139,n1)) != n0
    | p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1)) ),
    c_0_7 ).

cnf(c_0_12,plain,
    ( ~ p_Reset(X1)
    | level(plus(X1,n1)) = n0 ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    p_Reset(t_139),
    quest_1 ).

cnf(c_0_14,plain,
    ( ~ p_Rd_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_30]) ).

cnf(c_0_15,plain,
    ( ~ p_Wr_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    c_0_10 ).

cnf(c_0_16,negated_conjecture,
    ( p_Wr_error(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,plain,
    ( ~ p_Rd_error(plus(X1,n1))
    | ~ p_Reset(X1) ),
    c_0_14 ).

cnf(c_0_18,negated_conjecture,
    p_Rd_error(plus(t_139,n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV009-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.51  % Computer : n018.cluster.edu
% 0.09/5.51  % Model    : x86_64 x86_64
% 0.09/5.51  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.51  % Memory   : 8046.5625MB
% 0.09/5.51  % OS       : Linux 6.8.0-71-generic
% 0.09/5.51  % CPULimit : 300
% 0.09/5.51  % WCLimit  : 300
% 0.09/5.51  % DateTime : Sun Sep 20 20:49:48 UTC 2026
% 0.09/5.51  % CPUTime  : 
% 0.09/5.51  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.55  Running first-order theorem proving
% 0.09/5.56  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.09/5.58  % Version: 3.5.1
% 0.09/5.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/5.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/5.58  % Starting new_bool_3 with 300s (1) cores
% 0.09/5.58  % Starting new_bool_1 with 300s (1) cores
% 0.09/5.58  % Starting sh5l with 300s (1) cores
% 0.09/5.58  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 169797 completed with status 0
% 0.09/5.58  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.09/5.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/5.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/5.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/5.58  % No SInE strategy applied
% 0.09/5.58  % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.09/5.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/5.58  % Starting SubtermCWHack with 136s (1) cores
% 0.09/5.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/5.58  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/5.58  % Starting new_bool_3 with 136s (1) cores
% 0.09/5.58  % Starting new_bool_1 with 136s (1) cores
% 0.09/5.58  % new_bool_3 with pid 169807 completed with status 0
% 0.09/5.58  % Result found by new_bool_3
% 0.09/5.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/5.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/5.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/5.58  % No SInE strategy applied
% 0.09/5.58  % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.09/5.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/5.58  % Starting SubtermCWHack with 136s (1) cores
% 0.09/5.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/5.58  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/5.58  % Starting new_bool_3 with 136s (1) cores
% 0.09/5.58  % Preprocessing time       : 0.001 s
% 0.09/5.58  % Presaturation interreduction done
% 0.09/5.58  
% 0.09/5.58  % Proof found!
% 0.09/5.58  % SZS status Unsatisfiable
% 0.09/5.58  % SZS output start CNFRefutation
% See solution above
% 0.09/5.58  % Parsed axioms                        : 92
% 0.09/5.58  % Removed by relevancy pruning/SinE    : 0
% 0.09/5.58  % Initial clauses                      : 92
% 0.09/5.58  % Removed in clause preprocessing      : 1
% 0.09/5.58  % Initial clauses in saturation        : 91
% 0.09/5.58  % Processed clauses                    : 115
% 0.09/5.58  % ...of these trivial                  : 0
% 0.09/5.58  % ...subsumed                          : 1
% 0.09/5.58  % ...remaining for further processing  : 114
% 0.09/5.58  % Other redundant clauses eliminated   : 3
% 0.09/5.58  % Clauses deleted for lack of memory   : 0
% 0.09/5.58  % Backward-subsumed                    : 17
% 0.09/5.58  % Backward-rewritten                   : 2
% 0.09/5.58  % Generated clauses                    : 13
% 0.09/5.58  % ...of the previous two non-redundant : 12
% 0.09/5.58  % ...aggressively subsumed             : 0
% 0.09/5.59  % Contextual simplify-reflections      : 61
% 0.09/5.59  % Paramodulations                      : 10
% 0.09/5.59  % Factorizations                       : 0
% 0.09/5.59  % NegExts                              : 0
% 0.09/5.59  % Equation resolutions                 : 3
% 0.09/5.59  % Disequality decompositions           : 0
% 0.09/5.59  % Total rewrite steps                  : 5
% 0.09/5.59  % ...of those cached                   : 2
% 0.09/5.59  % Propositional unsat checks           : 0
% 0.09/5.59  %    Propositional check models        : 0
% 0.09/5.59  %    Propositional check unsatisfiable : 0
% 0.09/5.59  %    Propositional clauses             : 0
% 0.09/5.59  %    Propositional clauses after purity: 0
% 0.09/5.59  %    Propositional unsat core size     : 0
% 0.09/5.59  %    Propositional preprocessing time  : 0.000
% 0.09/5.59  %    Propositional encoding time       : 0.000
% 0.09/5.59  %    Propositional solver time         : 0.000
% 0.09/5.59  %    Success case prop preproc time    : 0.000
% 0.09/5.59  %    Success case prop encoding time   : 0.000
% 0.09/5.59  %    Success case prop solver time     : 0.000
% 0.09/5.59  % Current number of processed clauses  : 19
% 0.09/5.59  %    Positive orientable unit clauses  : 5
% 0.09/5.59  %    Positive unorientable unit clauses: 0
% 0.09/5.59  %    Negative unit clauses             : 4
% 0.09/5.59  %    Non-unit-clauses                  : 10
% 0.09/5.59  % Current number of unprocessed clauses: 61
% 0.09/5.59  % ...number of literals in the above   : 211
% 0.09/5.59  % Current number of archived formulas  : 0
% 0.09/5.59  % Current number of archived clauses   : 93
% 0.09/5.59  % Clause-clause subsumption calls (NU) : 1738
% 0.09/5.59  % Rec. Clause-clause subsumption calls : 209
% 0.09/5.59  % Non-unit clause-clause subsumptions  : 79
% 0.09/5.59  % Unit Clause-clause subsumption calls : 5
% 0.09/5.59  % Rewrite failures with RHS unbound    : 0
% 0.09/5.59  % BW rewrite match attempts            : 2
% 0.09/5.59  % BW rewrite match successes           : 2
% 0.09/5.59  % Condensation attempts                : 0
% 0.09/5.59  % Condensation successes               : 0
% 0.09/5.59  % Termbank termtop insertions          : 5609
% 0.09/5.59  % Search garbage collected termcells   : 189
% 0.09/5.59  
% 0.09/5.59  % -------------------------------------------------
% 0.09/5.59  % User time                : 0.006 s
% 0.09/5.59  % System time              : 0.005 s
% 0.09/5.59  % Total time               : 0.012 s
% 0.09/5.59  % Maximum resident set size: 3704 pages
% 0.09/5.59  
% 0.09/5.59  % -------------------------------------------------
% 0.09/5.59  % User time                : 0.029 s
% 0.09/5.59  % System time              : 0.022 s
% 0.09/5.59  % Total time               : 0.050 s
% 0.09/5.59  % Maximum resident set size: 4608 pages
% 0.09/5.59  % E exiting
%------------------------------------------------------------------------------