TSTP Solution File: HWV018-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HWV018-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:02:59 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% 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_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',quest_5) ).
cnf(axiom_22,axiom,
( p_Full(X1)
| int_level(X1) != fifo_length ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_22) ).
cnf(axiom_23,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_23) ).
cnf(axiom_44,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Wr(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_44) ).
cnf(axiom_42,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| p_Wr_error(plus(X1,n1))
| ~ p_Wr(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_42) ).
cnf(quest_3,negated_conjecture,
p_Full(t_139),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',quest_3) ).
cnf(quest_1,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',quest_1) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',quest_4) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_17) ).
cnf(axiom_82,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',axiom_82) ).
cnf(quest_2,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/tmp/tmp.znCs3aRHCG/E---3.1_27924.p',quest_2) ).
cnf(c_0_11,negated_conjecture,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_12,plain,
( p_Full(X1)
| int_level(X1) != fifo_length ),
inference(fof_simplification,[status(thm)],[axiom_22]) ).
cnf(c_0_13,plain,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
inference(fof_simplification,[status(thm)],[axiom_23]) ).
cnf(c_0_14,plain,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Wr(X1) ),
inference(fof_simplification,[status(thm)],[axiom_44]) ).
cnf(c_0_15,negated_conjecture,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
c_0_11 ).
cnf(c_0_16,plain,
( p_Full(X1)
| int_level(X1) != fifo_length ),
c_0_12 ).
cnf(c_0_17,plain,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| p_Wr_error(plus(X1,n1))
| ~ p_Wr(X1) ),
inference(fof_simplification,[status(thm)],[axiom_42]) ).
cnf(c_0_18,plain,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
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_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Wr(X1) ),
c_0_14 ).
cnf(c_0_24,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
axiom_82 ).
cnf(c_0_25,negated_conjecture,
( int_level(plus(t_139,n1)) != fifo_length
| ~ p_Wr_error(plus(t_139,n1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| p_Wr_error(plus(X1,n1))
| ~ p_Wr(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,
( int_level(plus(X1,n1)) = int_level(X1)
| p_Rd(X1)
| p_Reset(X1)
| gt(fifo_length,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.06/0.12 % Problem : HWV018-1 : TPTP v8.1.2. Released v2.5.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 17:53:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/tmp/tmp.znCs3aRHCG/E---3.1_27924.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 28003 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 28006 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 95
% 0.20/0.51 # Removed by relevancy pruning/SinE : 41
% 0.20/0.51 # Initial clauses : 54
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 54
% 0.20/0.51 # Processed clauses : 160
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 28
% 0.20/0.51 # ...remaining for further processing : 132
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 10
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 290
% 0.20/0.51 # ...of the previous two non-redundant : 209
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 27
% 0.20/0.51 # Paramodulations : 285
% 0.20/0.51 # Factorizations : 4
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 1
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 66
% 0.20/0.51 # ...of those cached : 60
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 73
% 0.20/0.51 # Positive orientable unit clauses : 6
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 7
% 0.20/0.51 # Non-unit-clauses : 60
% 0.20/0.51 # Current number of unprocessed clauses: 114
% 0.20/0.51 # ...number of literals in the above : 529
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 59
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 900
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 314
% 0.20/0.51 # Non-unit clause-clause subsumptions : 49
% 0.20/0.51 # Unit Clause-clause subsumption calls : 23
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 7016
% 0.20/0.51 # Search garbage collected termcells : 263
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.015 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.016 s
% 0.20/0.51 # Maximum resident set size: 1880 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.019 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.021 s
% 0.20/0.51 # Maximum resident set size: 1760 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------