↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : HWV012-2 : 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 : n011.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:47:20 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (  10 unt;   4 nHn;  20 RR)
%            Number of literals    :   54 (   2 equ;  31 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_22,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_22) ).

cnf(axiom_41,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_41) ).

cnf(axiom_13,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_13) ).

cnf(axiom_5,axiom,
    fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_5) ).

cnf(quest_1,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(quest_3,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

cnf(quest_2,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

cnf(c_0_7,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1)) ),
    inference(fof_simplification,[status(thm)],[axiom_22]) ).

cnf(c_0_8,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
    inference(fof_simplification,[status(thm)],[axiom_41]) ).

cnf(c_0_9,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1))) ),
    inference(fof_simplification,[status(thm)],[axiom_13]) ).

cnf(c_0_10,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1)) ),
    c_0_7 ).

cnf(c_0_11,axiom,
    fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
    axiom_5 ).

cnf(c_0_12,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
    c_0_8 ).

cnf(c_0_13,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1))) ),
    c_0_9 ).

cnf(c_0_14,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
    inference(fof_simplification,[status(thm)],[quest_1]) ).

cnf(c_0_15,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1))) ),
    inference(csr,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
    c_0_14 ).

cnf(c_0_18,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))),
    quest_3 ).

cnf(c_0_20,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    quest_2 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV012-2 : 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/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 20:48:10 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.14/0.43  % Version: 3.5.1
% 0.14/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % Starting sh5l with 300s (1) cores
% 0.14/0.43  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 154717 completed with status 0
% 0.14/0.43  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43  % No SInE strategy applied
% 0.14/0.43  % Search class: FGHSM-FSLS31-MFFFFFNN
% 0.14/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 244s (1) cores
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 136s (1) cores
% 0.14/0.43  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 136s (1) cores
% 0.14/0.43  % G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with pid 154724 completed with status 0
% 0.14/0.43  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S06DI
% 0.14/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43  % No SInE strategy applied
% 0.14/0.43  % Search class: FGHSM-FSLS31-MFFFFFNN
% 0.14/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 244s (1) cores
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 136s (1) cores
% 0.14/0.43  % Preprocessing time       : 0.002 s
% 0.14/0.43  % Presaturation interreduction done
% 0.14/0.43  
% 0.14/0.43  % Proof found!
% 0.14/0.43  % SZS status Unsatisfiable
% 0.14/0.43  % SZS output start CNFRefutation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 136
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 136
% 0.14/0.43  % Removed in clause preprocessing      : 1
% 0.14/0.43  % Initial clauses in saturation        : 135
% 0.14/0.43  % Processed clauses                    : 180
% 0.14/0.43  % ...of these trivial                  : 0
% 0.14/0.43  % ...subsumed                          : 1
% 0.14/0.43  % ...remaining for further processing  : 179
% 0.14/0.43  % Other redundant clauses eliminated   : 5
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 10
% 0.14/0.43  % Backward-rewritten                   : 1
% 0.14/0.43  % Generated clauses                    : 19
% 0.14/0.43  % ...of the previous two non-redundant : 16
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 30
% 0.14/0.43  % Paramodulations                      : 14
% 0.14/0.43  % Factorizations                       : 0
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 5
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 4
% 0.14/0.43  % ...of those cached                   : 1
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 40
% 0.14/0.43  %    Positive orientable unit clauses  : 9
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 12
% 0.14/0.43  %    Non-unit-clauses                  : 19
% 0.14/0.43  % Current number of unprocessed clauses: 92
% 0.14/0.43  % ...number of literals in the above   : 279
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 135
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 6508
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 1053
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 41
% 0.14/0.43  % Unit Clause-clause subsumption calls : 32
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 4
% 0.14/0.43  % BW rewrite match successes           : 1
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 7519
% 0.14/0.43  % Search garbage collected termcells   : 240
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.012 s
% 0.14/0.43  % System time              : 0.001 s
% 0.14/0.43  % Total time               : 0.013 s
% 0.14/0.43  % Maximum resident set size: 3744 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.051 s
% 0.14/0.43  % System time              : 0.014 s
% 0.14/0.43  % Total time               : 0.064 s
% 0.14/0.43  % Maximum resident set size: 4608 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------