↑ 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  : HWV024-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 : n017.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:48 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (   9 unt;  17 nHn;  32 RR)
%            Number of literals    :   96 (   0 equ;  40 neg)
%            Maximal clause size   :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_48,axiom,
    ( ~ p_Data_out(X2,X1)
    | ~ p_Wr(X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_48) ).

cnf(axiom_84,axiom,
    ( ~ p_Data_out(X2,X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_84) ).

cnf(axiom_83,axiom,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_83) ).

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

cnf(quest_3,negated_conjecture,
    ( ~ p_Data_out(x_139,plus(x_140,n1))
    | ~ p_Data_out(x_139,x_140) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

cnf(quest_1,negated_conjecture,
    ~ p_Rd(x_140),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(quest_2,negated_conjecture,
    ~ p_Reset(x_140),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

cnf(axiom_47,axiom,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | ~ p_Wr(X1)
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_47) ).

cnf(quest_4,negated_conjecture,
    ( p_Data_out(x_139,plus(x_140,n1))
    | p_Data_out(x_139,x_140) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

cnf(c_0_9,plain,
    ( ~ p_Data_out(X2,X1)
    | ~ p_Wr(X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_48]) ).

cnf(c_0_10,plain,
    ( ~ p_Data_out(X2,X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_84]) ).

cnf(c_0_11,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_83]) ).

cnf(c_0_12,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | ~ p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_32]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p_Data_out(x_139,plus(x_140,n1))
    | ~ p_Data_out(x_139,x_140) ),
    inference(fof_simplification,[status(thm)],[quest_3]) ).

cnf(c_0_14,plain,
    ( ~ p_Data_out(X2,X1)
    | ~ p_Wr(X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    c_0_9 ).

cnf(c_0_15,plain,
    ( ~ p_Data_out(X2,X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    c_0_10 ).

cnf(c_0_16,negated_conjecture,
    ~ p_Rd(x_140),
    inference(fof_simplification,[status(thm)],[quest_1]) ).

cnf(c_0_17,negated_conjecture,
    ~ p_Reset(x_140),
    inference(fof_simplification,[status(thm)],[quest_2]) ).

cnf(c_0_18,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | ~ p_Wr(X1)
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_47]) ).

cnf(c_0_19,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    c_0_11 ).

cnf(c_0_20,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | ~ p_Reset(X1) ),
    c_0_12 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p_Data_out(x_139,plus(x_140,n1))
    | ~ p_Data_out(x_139,x_140) ),
    c_0_13 ).

cnf(c_0_22,plain,
    ( ~ p_Data_out(X2,X1)
    | p_Reset(X1)
    | p_Data_out(X2,plus(X1,n1))
    | p_Rd(X1) ),
    inference(csr,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    ~ p_Rd(x_140),
    c_0_16 ).

cnf(c_0_24,negated_conjecture,
    ~ p_Reset(x_140),
    c_0_17 ).

cnf(c_0_25,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | ~ p_Wr(X1)
    | p_Data_out(X2,X1)
    | p_Rd(X1)
    | p_Reset(X1) ),
    c_0_18 ).

cnf(c_0_26,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | p_Data_out(X2,X1)
    | p_Wr(X1)
    | p_Rd(X1) ),
    inference(csr,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    ( p_Data_out(x_139,plus(x_140,n1))
    | p_Data_out(x_139,x_140) ),
    quest_4 ).

cnf(c_0_28,negated_conjecture,
    ~ p_Data_out(x_139,x_140),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).

cnf(c_0_29,plain,
    ( ~ p_Data_out(X2,plus(X1,n1))
    | p_Data_out(X2,X1)
    | p_Rd(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25,c_0_26]),c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    p_Data_out(x_139,plus(x_140,n1)),
    inference(sr,[status(thm)],[c_0_27,c_0_28]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV024-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.11/0.37  % Computer : n017.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 : Sun Sep 20 20:44:11 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  Running first-order theorem proving
% 0.15/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.15/0.45  % Version: 3.5.1
% 0.15/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % sh5l with pid 612222 completed with status 0
% 0.15/0.45  % Result found by sh5l
% 0.15/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45  % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.15/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45  % SubtermCWHack with pid 612228 completed with status 0
% 0.15/0.45  % Result found by SubtermCWHack
% 0.15/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45  % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.15/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45  % Preprocessing time       : 0.001 s
% 0.15/0.45  
% 0.15/0.45  % Proof found!
% 0.15/0.45  % SZS status Unsatisfiable
% 0.15/0.45  % SZS output start CNFRefutation
% See solution above
% 0.15/0.45  % Parsed axioms                        : 94
% 0.15/0.45  % Removed by relevancy pruning/SinE    : 6
% 0.15/0.45  % Initial clauses                      : 88
% 0.15/0.45  % Removed in clause preprocessing      : 0
% 0.15/0.45  % Initial clauses in saturation        : 88
% 0.15/0.45  % Processed clauses                    : 341
% 0.15/0.45  % ...of these trivial                  : 2
% 0.15/0.45  % ...subsumed                          : 178
% 0.15/0.45  % ...remaining for further processing  : 161
% 0.15/0.45  % Other redundant clauses eliminated   : 7
% 0.15/0.45  % Clauses deleted for lack of memory   : 0
% 0.15/0.45  % Backward-subsumed                    : 18
% 0.15/0.45  % Backward-rewritten                   : 5
% 0.15/0.45  % Generated clauses                    : 951
% 0.15/0.45  % ...of the previous two non-redundant : 678
% 0.15/0.45  % ...aggressively subsumed             : 0
% 0.15/0.45  % Contextual simplify-reflections      : 22
% 0.15/0.45  % Paramodulations                      : 938
% 0.15/0.45  % Factorizations                       : 4
% 0.15/0.45  % NegExts                              : 0
% 0.15/0.45  % Equation resolutions                 : 8
% 0.15/0.45  % Disequality decompositions           : 0
% 0.15/0.45  % Total rewrite steps                  : 348
% 0.15/0.45  % ...of those cached                   : 319
% 0.15/0.45  % Propositional unsat checks           : 0
% 0.15/0.45  %    Propositional check models        : 0
% 0.15/0.45  %    Propositional check unsatisfiable : 0
% 0.15/0.45  %    Propositional clauses             : 0
% 0.15/0.45  %    Propositional clauses after purity: 0
% 0.15/0.45  %    Propositional unsat core size     : 0
% 0.15/0.45  %    Propositional preprocessing time  : 0.000
% 0.15/0.45  %    Propositional encoding time       : 0.000
% 0.15/0.45  %    Propositional solver time         : 0.000
% 0.15/0.45  %    Success case prop preproc time    : 0.000
% 0.15/0.45  %    Success case prop encoding time   : 0.000
% 0.15/0.45  %    Success case prop solver time     : 0.000
% 0.15/0.45  % Current number of processed clauses  : 134
% 0.15/0.45  %    Positive orientable unit clauses  : 10
% 0.15/0.45  %    Positive unorientable unit clauses: 0
% 0.15/0.45  %    Negative unit clauses             : 12
% 0.15/0.45  %    Non-unit-clauses                  : 112
% 0.15/0.45  % Current number of unprocessed clauses: 408
% 0.15/0.45  % ...number of literals in the above   : 1610
% 0.15/0.45  % Current number of archived formulas  : 0
% 0.15/0.45  % Current number of archived clauses   : 24
% 0.15/0.45  % Clause-clause subsumption calls (NU) : 1264
% 0.15/0.45  % Rec. Clause-clause subsumption calls : 697
% 0.15/0.45  % Non-unit clause-clause subsumptions  : 139
% 0.15/0.45  % Unit Clause-clause subsumption calls : 174
% 0.15/0.45  % Rewrite failures with RHS unbound    : 0
% 0.15/0.45  % BW rewrite match attempts            : 27
% 0.15/0.45  % BW rewrite match successes           : 5
% 0.15/0.45  % Condensation attempts                : 0
% 0.15/0.45  % Condensation successes               : 0
% 0.15/0.45  % Termbank termtop insertions          : 16107
% 0.15/0.45  % Search garbage collected termcells   : 205
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.014 s
% 0.15/0.45  % System time              : 0.002 s
% 0.15/0.45  % Total time               : 0.016 s
% 0.15/0.45  % Maximum resident set size: 3652 pages
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.017 s
% 0.15/0.45  % System time              : 0.006 s
% 0.15/0.45  % Total time               : 0.023 s
% 0.15/0.45  % Maximum resident set size: 4608 pages
% 0.15/0.45  % E exiting
%------------------------------------------------------------------------------