↑ 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  : HWV018-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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 12:48:46 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.45s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   35 (  16 unt;   9 nHn;  32 RR)
%            Number of literals    :   78 (  15 equ;  30 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(quest_5,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).

cnf(axiom_22,axiom,
    ( int_level(X1) != fifo_length
    | p_Full(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_22) ).

cnf(axiom_23,axiom,
    ( ~ p_Full(X1)
    | int_level(X1) = fifo_length ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).

cnf(axiom_44,axiom,
    ( ~ p_Wr(X1)
    | int_level(plus(X1,n1)) = int_level(X1)
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_44) ).

cnf(axiom_42,axiom,
    ( ~ p_Wr(X1)
    | p_Wr_error(plus(X1,n1))
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_42) ).

cnf(quest_3,negated_conjecture,
    p_Full(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).

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

cnf(quest_4,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).

cnf(axiom_17,axiom,
    ~ gt(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).

cnf(axiom_82,axiom,
    ( int_level(plus(X1,n1)) = int_level(X1)
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_82) ).

cnf(quest_2,negated_conjecture,
    p_Wr(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    inference(fof_simplification,[status(thm)],[quest_5]) ).

cnf(c_0_12,plain,
    ( int_level(X1) != fifo_length
    | p_Full(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_22]) ).

cnf(c_0_13,plain,
    ( ~ p_Full(X1)
    | int_level(X1) = fifo_length ),
    inference(fof_simplification,[status(thm)],[axiom_23]) ).

cnf(c_0_14,plain,
    ( ~ p_Wr(X1)
    | int_level(plus(X1,n1)) = int_level(X1)
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_44]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    c_0_11 ).

cnf(c_0_16,plain,
    ( int_level(X1) != fifo_length
    | p_Full(X1) ),
    c_0_12 ).

cnf(c_0_17,plain,
    ( ~ p_Wr(X1)
    | p_Wr_error(plus(X1,n1))
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_42]) ).

cnf(c_0_18,plain,
    ( ~ p_Full(X1)
    | int_level(X1) = fifo_length ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    p_Full(t_139),
    quest_3 ).

cnf(c_0_20,negated_conjecture,
    ~ p_Rd(t_139),
    inference(fof_simplification,[status(thm)],[quest_1]) ).

cnf(c_0_21,negated_conjecture,
    ~ p_Reset(t_139),
    inference(fof_simplification,[status(thm)],[quest_4]) ).

cnf(c_0_22,plain,
    ~ gt(X1,X1),
    inference(fof_simplification,[status(thm)],[axiom_17]) ).

cnf(c_0_23,plain,
    ( ~ p_Wr(X1)
    | int_level(plus(X1,n1)) = int_level(X1)
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    c_0_14 ).

cnf(c_0_24,axiom,
    ( int_level(plus(X1,n1)) = int_level(X1)
    | p_Rd(X1)
    | p_Wr(X1)
    | p_Reset(X1) ),
    axiom_82 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | int_level(plus(t_139,n1)) != fifo_length ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_26,plain,
    ( ~ p_Wr(X1)
    | p_Wr_error(plus(X1,n1))
    | gt(fifo_length,int_level(X1))
    | p_Rd(X1)
    | p_Reset(X1) ),
    c_0_17 ).

cnf(c_0_27,negated_conjecture,
    int_level(t_139) = fifo_length,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_28,negated_conjecture,
    p_Wr(t_139),
    quest_2 ).

cnf(c_0_29,negated_conjecture,
    ~ p_Rd(t_139),
    c_0_20 ).

cnf(c_0_30,negated_conjecture,
    ~ p_Reset(t_139),
    c_0_21 ).

cnf(c_0_31,plain,
    ~ gt(X1,X1),
    c_0_22 ).

cnf(c_0_32,plain,
    ( gt(fifo_length,int_level(X1))
    | p_Reset(X1)
    | p_Rd(X1)
    | int_level(plus(X1,n1)) = int_level(X1) ),
    inference(csr,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    int_level(plus(t_139,n1)) != fifo_length,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),c_0_30]),c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_33]),c_0_29]),c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HWV018-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.37  % Computer : n015.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sun Sep 20 20:51:41 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.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.14/5.45  % Version: 3.5.1
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45  % Starting sh5l with 300s (1) cores
% 0.14/5.45  % new_bool_3 with pid 3915955 completed with status 0
% 0.14/5.45  % Result found by new_bool_3
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45  % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/5.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45  % SubtermCWHack with pid 3915959 completed with status 0
% 0.14/5.45  % Result found by SubtermCWHack
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45  % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/5.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45  % Preprocessing time       : 0.002 s
% 0.14/5.45  
% 0.14/5.45  % Proof found!
% 0.14/5.45  % SZS status Unsatisfiable
% 0.14/5.45  % SZS output start CNFRefutation
% See solution above
% 0.14/5.45  % Parsed axioms                        : 95
% 0.14/5.45  % Removed by relevancy pruning/SinE    : 41
% 0.14/5.45  % Initial clauses                      : 54
% 0.14/5.45  % Removed in clause preprocessing      : 0
% 0.14/5.45  % Initial clauses in saturation        : 54
% 0.14/5.45  % Processed clauses                    : 66
% 0.14/5.45  % ...of these trivial                  : 0
% 0.14/5.45  % ...subsumed                          : 11
% 0.14/5.45  % ...remaining for further processing  : 55
% 0.14/5.45  % Other redundant clauses eliminated   : 0
% 0.14/5.45  % Clauses deleted for lack of memory   : 0
% 0.14/5.45  % Backward-subsumed                    : 2
% 0.14/5.45  % Backward-rewritten                   : 1
% 0.14/5.45  % Generated clauses                    : 95
% 0.14/5.45  % ...of the previous two non-redundant : 65
% 0.14/5.45  % ...aggressively subsumed             : 0
% 0.14/5.45  % Contextual simplify-reflections      : 3
% 0.14/5.45  % Paramodulations                      : 92
% 0.14/5.45  % Factorizations                       : 2
% 0.14/5.45  % NegExts                              : 0
% 0.14/5.45  % Equation resolutions                 : 1
% 0.14/5.45  % Disequality decompositions           : 0
% 0.14/5.45  % Total rewrite steps                  : 13
% 0.14/5.45  % ...of those cached                   : 7
% 0.14/5.45  % Propositional unsat checks           : 0
% 0.14/5.45  %    Propositional check models        : 0
% 0.14/5.45  %    Propositional check unsatisfiable : 0
% 0.14/5.45  %    Propositional clauses             : 0
% 0.14/5.45  %    Propositional clauses after purity: 0
% 0.14/5.45  %    Propositional unsat core size     : 0
% 0.14/5.45  %    Propositional preprocessing time  : 0.000
% 0.14/5.45  %    Propositional encoding time       : 0.000
% 0.14/5.45  %    Propositional solver time         : 0.000
% 0.14/5.45  %    Success case prop preproc time    : 0.000
% 0.14/5.45  %    Success case prop encoding time   : 0.000
% 0.14/5.45  %    Success case prop solver time     : 0.000
% 0.14/5.45  % Current number of processed clauses  : 52
% 0.14/5.45  %    Positive orientable unit clauses  : 6
% 0.14/5.45  %    Positive unorientable unit clauses: 0
% 0.14/5.45  %    Negative unit clauses             : 8
% 0.14/5.45  %    Non-unit-clauses                  : 38
% 0.14/5.45  % Current number of unprocessed clauses: 51
% 0.14/5.45  % ...number of literals in the above   : 216
% 0.14/5.45  % Current number of archived formulas  : 0
% 0.14/5.45  % Current number of archived clauses   : 3
% 0.14/5.45  % Clause-clause subsumption calls (NU) : 68
% 0.14/5.45  % Rec. Clause-clause subsumption calls : 43
% 0.14/5.45  % Non-unit clause-clause subsumptions  : 7
% 0.14/5.45  % Unit Clause-clause subsumption calls : 7
% 0.14/5.45  % Rewrite failures with RHS unbound    : 0
% 0.14/5.45  % BW rewrite match attempts            : 1
% 0.14/5.45  % BW rewrite match successes           : 1
% 0.14/5.45  % Condensation attempts                : 0
% 0.14/5.45  % Condensation successes               : 0
% 0.14/5.45  % Termbank termtop insertions          : 3958
% 0.14/5.45  % Search garbage collected termcells   : 263
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.006 s
% 0.14/5.45  % System time              : 0.004 s
% 0.14/5.45  % Total time               : 0.010 s
% 0.14/5.45  % Maximum resident set size: 3704 pages
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.008 s
% 0.14/5.45  % System time              : 0.010 s
% 0.14/5.45  % Total time               : 0.018 s
% 0.14/5.45  % Maximum resident set size: 4608 pages
% 0.14/5.45  % E exiting
%------------------------------------------------------------------------------