TSTP Solution File: HWV022-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:55:14 EDT 2023
% Result : Timeout 408.42s 300.17s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 46 ( 22 unt; 10 nHn; 37 RR)
% Number of literals : 78 ( 34 equ; 31 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_5) ).
cnf(quest_1,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',quest_1) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_21) ).
cnf(axiom_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_18) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_19) ).
cnf(axiom_8,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_8) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_2) ).
cnf(axiom_6,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_6) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_15) ).
cnf(quest_5,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',quest_5) ).
cnf(axiom_35,axiom,
( p_Reset(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| ~ p_Wr(X1)
| ~ gt(fifo_length,int_level(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_35) ).
cnf(quest_3,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',quest_3) ).
cnf(quest_2,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',quest_2) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',quest_4) ).
cnf(axiom_3,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
file('/export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p',axiom_3) ).
cnf(c_0_15,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
axiom_5 ).
cnf(c_0_16,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
quest_1 ).
cnf(c_0_17,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
axiom_18 ).
cnf(c_0_19,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_20,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
plus(int_level(t_139),n1) = fifo_length,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
axiom_8 ).
cnf(c_0_23,plain,
( X1 = n0
| plus(X1,n1) != n1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_25,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
axiom_6 ).
cnf(c_0_26,negated_conjecture,
( minus(fifo_length,n1) = int_level(t_139)
| def_10(n1,fifo_length) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( gt(fifo_length,plus(X1,n1))
| ~ gt(int_level(t_139),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_29,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
quest_5 ).
cnf(c_0_30,axiom,
( p_Reset(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| ~ p_Wr(X1)
| ~ gt(fifo_length,int_level(X1)) ),
axiom_35 ).
cnf(c_0_31,negated_conjecture,
( int_level(t_139) = n0
| fifo_length != n1 ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
p_Wr(t_139),
quest_3 ).
cnf(c_0_33,negated_conjecture,
gt(fifo_length,n0),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
~ p_Rd(t_139),
quest_2 ).
cnf(c_0_35,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_36,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
axiom_3 ).
cnf(c_0_37,negated_conjecture,
( minus(fifo_length,n1) = int_level(t_139)
| ~ gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
( int_level(t_139) = n0
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19]) ).
cnf(c_0_39,negated_conjecture,
int_level(plus(t_139,n1)) != fifo_length,
inference(rw,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
( int_level(plus(t_139,n1)) = n1
| fifo_length != n1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_32]),c_0_33])]),c_0_34]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( gt(fifo_length,int_level(t_139))
| ~ gt(fifo_length,n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
( fifo_length = n1
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_38]),c_0_19]) ).
cnf(c_0_43,negated_conjecture,
fifo_length != n1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ gt(fifo_length,n1),
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_30,c_0_41]),c_0_21]),c_0_32])]),c_0_39]),c_0_34]),c_0_35]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 05:31:54 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.jcI2M76vxj/E---3.1_25261.p
% 408.42/300.17 # Version: 3.1pre001
% 408.42/300.17 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.42/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.42/300.17 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.42/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.42/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.42/300.17 # Starting sh5l with 300s (1) cores
% 408.42/300.17 # sh5l with pid 25341 completed with status 0
% 408.42/300.17 # Result found by sh5l
% 408.42/300.17 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.42/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.42/300.17 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.42/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.42/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.42/300.17 # Starting sh5l with 300s (1) cores
% 408.42/300.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.42/300.17 # Search class: FGHSS-FFMS21-SFFFFFNN
% 408.42/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.42/300.17 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.42/300.17 # SAT001_MinMin_p005000_rr_RG with pid 25344 completed with status 0
% 408.42/300.17 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.42/300.17 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.42/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.42/300.17 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.42/300.17 # Starting new_bool_3 with 300s (1) cores
% 408.42/300.17 # Starting new_bool_1 with 300s (1) cores
% 408.42/300.17 # Starting sh5l with 300s (1) cores
% 408.42/300.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.42/300.17 # Search class: FGHSS-FFMS21-SFFFFFNN
% 408.42/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.42/300.17 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.42/300.17 # Preprocessing time : 0.002 s
% 408.42/300.17 # Presaturation interreduction done
% 408.42/300.17
% 408.42/300.17 # Proof found!
% 408.42/300.17 # SZS status Unsatisfiable
% 408.42/300.17 # SZS output start CNFRefutation
% See solution above
% 408.42/300.17 # Parsed axioms : 95
% 408.42/300.17 # Removed by relevancy pruning/SinE : 5
% 408.42/300.17 # Initial clauses : 90
% 408.42/300.17 # Removed in clause preprocessing : 0
% 408.42/300.17 # Initial clauses in saturation : 90
% 408.42/300.17 # Processed clauses : 286
% 408.42/300.17 # ...of these trivial : 0
% 408.42/300.17 # ...subsumed : 42
% 408.42/300.17 # ...remaining for further processing : 243
% 408.42/300.17 # Other redundant clauses eliminated : 8
% 408.42/300.17 # Clauses deleted for lack of memory : 0
% 408.42/300.17 # Backward-subsumed : 39
% 408.42/300.17 # Backward-rewritten : 3
% 408.42/300.17 # Generated clauses : 346
% 408.42/300.17 # ...of the previous two non-redundant : 291
% 408.42/300.17 # ...aggressively subsumed : 0
% 408.42/300.17 # Contextual simplify-reflections : 62
% 408.42/300.17 # Paramodulations : 332
% 408.42/300.17 # Factorizations : 2
% 408.42/300.17 # NegExts : 0
% 408.42/300.17 # Equation resolutions : 9
% 408.42/300.17 # Total rewrite steps : 57
% 408.42/300.17 # Propositional unsat checks : 0
% 408.42/300.17 # Propositional check models : 0
% 408.42/300.17 # Propositional check unsatisfiable : 0
% 408.42/300.17 # Propositional clauses : 0
% 408.42/300.17 # Propositional clauses after purity: 0
% 408.42/300.17 # Propositional unsat core size : 0
% 408.42/300.17 # Propositional preprocessing time : 0.000
% 408.42/300.17 # Propositional encoding time : 0.000
% 408.42/300.17 # Propositional solver time : 0.000
% 408.42/300.17 # Success case prop preproc time : 0.000
% 408.42/300.17 # Success case prop encoding time : 0.000
% 408.42/300.17 # Success case prop solver time : 0.000
% 408.42/300.17 # Current number of processed clauses : 123
% 408.42/300.17 # Positive orientable unit clauses : 8
% 408.42/300.17 # Positive unorientable unit clauses: 0
% 408.42/300.17 # Negative unit clauses : 12
% 408.42/300.17 # Non-unit-clauses : 103
% 408.42/300.17 # Current number of unprocessed clauses: 165
% 408.42/300.17 # ...number of literals in the above : 637
% 408.42/300.17 # Current number of archived formulas : 0
% 408.42/300.17 # Current number of archived clauses : 117
% 408.42/300.17 # Clause-clause subsumption calls (NU) : 3169
% 408.42/300.17 # Rec. Clause-clause subsumption calls : 1017
% 408.42/300.17 # Non-unit clause-clause subsumptions : 102
% 408.42/300.17 # Unit Clause-clause subsumption calls : 125
% 408.42/300.17 # Rewrite failures with RHS unbound : 0
% 408.42/300.17 # BW rewrite match attempts : 6
% 408.42/300.17 # BW rewrite match successes : 3
% 408.42/300.17 # Condensation attempts : 0
% 408.42/300.17 # Condensation successes : 0
% 408.42/300.17 # Termbank termtop insertions : 8267
% 408.42/300.17
% 408.42/300.17 # -------------------------------------------------
% 408.42/300.17 # User time : 0.024 s
% 408.42/300.17 # System time : 0.001 s
% 408.42/300.17 # Total time : 0.025 s
% 408.42/300.17 # Maximum resident set size: 1768 pages
% 408.42/300.17
% 408.42/300.17 # -------------------------------------------------
% 408.42/300.17 # User time : 0.027 s
% 408.42/300.17 # System time : 0.003 s
% 408.42/300.17 # Total time : 0.030 s
% 408.42/300.17 # Maximum resident set size: 1740 pages
% 408.42/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------