TSTP Solution File: HWV023-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV023-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:51:16 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 51 ( 24 unt; 10 nHn; 39 RR)
% Number of literals : 91 ( 27 equ; 36 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_72,axiom,
( f_ADD_(X1,n1) = X2
| p_LES_EQU_(X2,X1)
| ~ p_LES_EQU_(X2,f_ADD_(X1,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_72) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_77) ).
cnf(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_60) ).
cnf(axiom_67,axiom,
( p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| ~ p_LES_EQU_(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_67) ).
cnf(axiom_66,axiom,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_66) ).
cnf(axiom_75,axiom,
p_LES_EQU_(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_75) ).
cnf(axiom_71,axiom,
( p_LES_EQU_(X3,X2)
| p_LES_EQU_(X1,X3)
| ~ p_LES_EQU_(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_71) ).
cnf(axiom_76,axiom,
( X1 = X2
| f_ADD_(X1,n1) != f_ADD_(X2,n1) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_76) ).
cnf(quest_1,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n1,
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',quest_1) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_5) ).
cnf(axiom_43,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1)
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_43) ).
cnf(quest_2,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',quest_2) ).
cnf(quest_3,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',quest_4) ).
cnf(quest_5,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',quest_5) ).
cnf(axiom_8,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0 ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_8) ).
cnf(axiom_61,axiom,
( p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(X1,f_SUB_(X1,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.wKKFxPufKh/E---3.1_30675.p',axiom_61) ).
cnf(c_0_17,axiom,
( f_ADD_(X1,n1) = X2
| p_LES_EQU_(X2,X1)
| ~ p_LES_EQU_(X2,f_ADD_(X1,n1)) ),
axiom_72 ).
cnf(c_0_18,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_19,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
axiom_60 ).
cnf(c_0_20,plain,
( n1 = X1
| p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(X1,n1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| ~ p_LES_EQU_(X1,X2) ),
axiom_67 ).
cnf(c_0_22,plain,
( f_ADD_(X1,n1) = n1
| ~ p_LES_EQU_(f_ADD_(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( p_LES_EQU_(f_ADD_(X1,n1),n1)
| ~ p_LES_EQU_(X1,n0) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_24,axiom,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
axiom_66 ).
cnf(c_0_25,plain,
( f_ADD_(X1,n1) = n1
| ~ p_LES_EQU_(X1,n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(n1,f_ADD_(X2,n1))
| ~ p_LES_EQU_(X1,n0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
p_LES_EQU_(X1,X1),
axiom_75 ).
cnf(c_0_28,axiom,
( p_LES_EQU_(X3,X2)
| p_LES_EQU_(X1,X3)
| ~ p_LES_EQU_(X1,X2) ),
axiom_71 ).
cnf(c_0_29,plain,
( p_LES_EQU_(n1,f_ADD_(X1,n1))
| ~ p_LES_EQU_(n0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_30,plain,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(X1,n0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27])]),c_0_28]) ).
cnf(c_0_31,axiom,
( X1 = X2
| f_ADD_(X1,n1) != f_ADD_(X2,n1) ),
axiom_76 ).
cnf(c_0_32,plain,
( f_ADD_(X1,n1) = n1
| p_LES_EQU_(n1,X1)
| ~ p_LES_EQU_(n0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_33,plain,
p_LES_EQU_(n0,X1),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n1,
quest_1 ).
cnf(c_0_35,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_36,plain,
( X1 = n0
| f_ADD_(X1,n1) != n1 ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_37,plain,
( f_ADD_(X1,n1) = n1
| p_LES_EQU_(n1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_38,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1)
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1)) ),
axiom_43 ).
cnf(c_0_39,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = n1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
quest_2 ).
cnf(c_0_41,plain,
~ p_LES_EQU_(n1,n0),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_42,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
quest_3 ).
cnf(c_0_43,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
quest_4 ).
cnf(c_0_44,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
quest_5 ).
cnf(c_0_45,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0 ),
axiom_8 ).
cnf(c_0_46,axiom,
( p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(X1,f_SUB_(X1,n1)) ),
axiom_61 ).
cnf(c_0_47,plain,
( X1 = n0
| p_LES_EQU_(n1,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,negated_conjecture,
f_SUB_(n1,n1) = fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) != n0,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_41]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : HWV023-2 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 05:59:44 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.wKKFxPufKh/E---3.1_30675.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 30755 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUSS-FFMS21-SFFFFFNN
% 0.21/0.53 # partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 30758 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUSS-FFMS21-SFFFFFNN
% 0.21/0.53 # partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 138
% 0.21/0.53 # Removed by relevancy pruning/SinE : 109
% 0.21/0.53 # Initial clauses : 29
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 29
% 0.21/0.53 # Processed clauses : 131
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 35
% 0.21/0.53 # ...remaining for further processing : 95
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 2
% 0.21/0.53 # Backward-rewritten : 9
% 0.21/0.53 # Generated clauses : 199
% 0.21/0.53 # ...of the previous two non-redundant : 146
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 2
% 0.21/0.53 # Paramodulations : 196
% 0.21/0.53 # Factorizations : 2
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 1
% 0.21/0.53 # Total rewrite steps : 68
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 57
% 0.21/0.53 # Positive orientable unit clauses : 8
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 9
% 0.21/0.53 # Non-unit-clauses : 40
% 0.21/0.53 # Current number of unprocessed clauses: 69
% 0.21/0.53 # ...number of literals in the above : 240
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 38
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 208
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 139
% 0.21/0.53 # Non-unit clause-clause subsumptions : 31
% 0.21/0.53 # Unit Clause-clause subsumption calls : 16
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 5
% 0.21/0.53 # BW rewrite match successes : 4
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 4418
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.009 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.011 s
% 0.21/0.53 # Maximum resident set size: 1844 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.015 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.017 s
% 0.21/0.53 # Maximum resident set size: 1784 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------