TSTP Solution File: KLE145+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE145+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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 : 600s
% DateTime : Sun Jul 17 01:56:13 EDT 2022
% Result : Theorem 0.65s 70.85s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 94 ( 78 unt; 0 def)
% Number of atoms : 112 ( 79 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 14 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 161 ( 4 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(goals,conjecture,
! [X4] : star(strong_iteration(X4)) = strong_iteration(X4),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(c_0_17,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_19,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X2] : addition(one,multiplication(star(X2),X2)) = star(X2),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_22,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_23,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_28,plain,
addition(one,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_30,plain,
addition(one,addition(X1,star(X2))) = addition(X1,star(X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
addition(one,addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
fof(c_0_32,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
fof(c_0_33,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_34,plain,
! [X4,X5,X6] :
( ~ leq(X6,addition(multiplication(X4,X6),X5))
| leq(X6,multiplication(strong_iteration(X4),X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_35,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
fof(c_0_36,plain,
! [X2] : strong_iteration(X2) = addition(multiplication(X2,strong_iteration(X2)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
cnf(c_0_37,plain,
addition(multiplication(star(X1),X1),star(X2)) = addition(star(X1),star(X2)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_43,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_44,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_45,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X6,X4),X5),X6)
| leq(multiplication(X5,star(X4)),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
cnf(c_0_46,plain,
addition(star(X1),multiplication(star(X2),X2)) = addition(star(X2),star(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_47,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25]) ).
cnf(c_0_48,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| addition(X1,addition(multiplication(X2,X1),X3)) != addition(multiplication(X2,X1),X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_50,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_52,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_53,plain,
! [X2] : addition(one,multiplication(X2,star(X2))) = star(X2),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
cnf(c_0_54,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20]) ).
cnf(c_0_56,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_57,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_58,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(pm,[status(thm)],[c_0_54,c_0_25]) ).
cnf(c_0_61,plain,
( leq(multiplication(X1,star(addition(X2,one))),star(X2))
| ~ leq(addition(star(X2),X1),star(X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_63,plain,
addition(one,addition(multiplication(X1,star(X1)),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_19,c_0_59]) ).
fof(c_0_64,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_65,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X1,multiplication(X3,addition(X2,one))) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_19]),c_0_25]),c_0_47]) ).
cnf(c_0_66,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_67,plain,
leq(star(addition(X1,one)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_25]),c_0_26]),c_0_62])]) ).
cnf(c_0_68,plain,
addition(multiplication(X1,star(X1)),star(X2)) = addition(star(X1),star(X2)),
inference(spm,[status(thm)],[c_0_30,c_0_63]) ).
cnf(c_0_69,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
fof(c_0_70,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_71,plain,
leq(star(X1),star(addition(X1,one))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_24]),c_0_58]) ).
cnf(c_0_72,plain,
addition(star(X1),star(addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_25]) ).
cnf(c_0_73,plain,
addition(star(X1),multiplication(X2,star(X2))) = addition(star(X2),star(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_68]) ).
cnf(c_0_74,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_58]),c_0_25]) ).
cnf(c_0_75,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_76,plain,
star(addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_71]),c_0_72]) ).
cnf(c_0_77,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_20]) ).
cnf(c_0_78,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(pm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_79,plain,
addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))) = star(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_59,c_0_75]) ).
cnf(c_0_80,plain,
star(addition(one,X1)) = star(X1),
inference(pm,[status(thm)],[c_0_76,c_0_25]) ).
cnf(c_0_81,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(pm,[status(thm)],[c_0_77,c_0_25]) ).
cnf(c_0_82,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
fof(c_0_83,negated_conjecture,
~ ! [X4] : star(strong_iteration(X4)) = strong_iteration(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_84,plain,
( leq(multiplication(X1,star(multiplication(X2,X1))),strong_iteration(X2))
| ~ leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_39]) ).
cnf(c_0_85,plain,
star(multiplication(X1,strong_iteration(X1))) = star(strong_iteration(X1)),
inference(spm,[status(thm)],[c_0_80,c_0_49]) ).
cnf(c_0_86,plain,
multiplication(strong_iteration(X1),star(strong_iteration(X1))) = star(strong_iteration(X1)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
multiplication(star(X1),addition(one,X1)) = star(X1),
inference(pm,[status(thm)],[c_0_55,c_0_25]) ).
fof(c_0_88,negated_conjecture,
star(strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_83])])]) ).
cnf(c_0_89,plain,
leq(star(strong_iteration(X1)),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_86]),c_0_62])]) ).
cnf(c_0_90,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_87]),c_0_19]),c_0_30]),c_0_25]),c_0_26]),c_0_87]) ).
cnf(c_0_91,negated_conjecture,
star(strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_92,plain,
star(strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_89]),c_0_25]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE145+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 09:15:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.45 eprover: CPU time limit exceeded, terminating
% 0.38/23.46 eprover: CPU time limit exceeded, terminating
% 0.38/23.47 eprover: CPU time limit exceeded, terminating
% 0.38/23.49 eprover: CPU time limit exceeded, terminating
% 0.51/46.51 eprover: CPU time limit exceeded, terminating
% 0.51/46.54 eprover: CPU time limit exceeded, terminating
% 0.51/46.54 eprover: CPU time limit exceeded, terminating
% 0.51/46.54 eprover: CPU time limit exceeded, terminating
% 0.64/69.54 eprover: CPU time limit exceeded, terminating
% 0.64/69.55 eprover: CPU time limit exceeded, terminating
% 0.64/69.55 eprover: CPU time limit exceeded, terminating
% 0.64/69.56 eprover: CPU time limit exceeded, terminating
% 0.65/70.85 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.65/70.85
% 0.65/70.85 # Failure: Resource limit exceeded (time)
% 0.65/70.85 # OLD status Res
% 0.65/70.85 # Preprocessing time : 0.026 s
% 0.65/70.85 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.65/70.85
% 0.65/70.85 # Failure: Resource limit exceeded (time)
% 0.65/70.85 # OLD status Res
% 0.65/70.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.65/70.85 # Preprocessing time : 0.013 s
% 0.65/70.85 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.65/70.85
% 0.65/70.85 # Failure: Resource limit exceeded (time)
% 0.65/70.85 # OLD status Res
% 0.65/70.85 # Preprocessing time : 0.014 s
% 0.65/70.85 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 0.65/70.85 # Preprocessing time : 0.008 s
% 0.65/70.85
% 0.65/70.85 # Proof found!
% 0.65/70.85 # SZS status Theorem
% 0.65/70.85 # SZS output start CNFRefutation
% See solution above
% 0.65/70.85 # Proof object total steps : 94
% 0.65/70.85 # Proof object clause steps : 59
% 0.65/70.85 # Proof object formula steps : 35
% 0.65/70.85 # Proof object conjectures : 5
% 0.65/70.85 # Proof object clause conjectures : 2
% 0.65/70.85 # Proof object formula conjectures : 3
% 0.65/70.85 # Proof object initial clauses used : 18
% 0.65/70.85 # Proof object initial formulas used : 17
% 0.65/70.85 # Proof object generating inferences : 39
% 0.65/70.85 # Proof object simplifying inferences : 31
% 0.65/70.85 # Training examples: 0 positive, 0 negative
% 0.65/70.85 # Parsed axioms : 19
% 0.65/70.85 # Removed by relevancy pruning/SinE : 0
% 0.65/70.85 # Initial clauses : 20
% 0.65/70.85 # Removed in clause preprocessing : 0
% 0.65/70.85 # Initial clauses in saturation : 20
% 0.65/70.85 # Processed clauses : 10236
% 0.65/70.85 # ...of these trivial : 556
% 0.65/70.85 # ...subsumed : 8604
% 0.65/70.85 # ...remaining for further processing : 1076
% 0.65/70.85 # Other redundant clauses eliminated : 0
% 0.65/70.85 # Clauses deleted for lack of memory : 0
% 0.65/70.85 # Backward-subsumed : 47
% 0.65/70.85 # Backward-rewritten : 378
% 0.65/70.85 # Generated clauses : 108641
% 0.65/70.85 # ...of the previous two non-trivial : 74592
% 0.65/70.85 # Contextual simplify-reflections : 1915
% 0.65/70.85 # Paramodulations : 108640
% 0.65/70.85 # Factorizations : 0
% 0.65/70.85 # Equation resolutions : 1
% 0.65/70.85 # Current number of processed clauses : 651
% 0.65/70.85 # Positive orientable unit clauses : 233
% 0.65/70.85 # Positive unorientable unit clauses: 8
% 0.65/70.85 # Negative unit clauses : 23
% 0.65/70.85 # Non-unit-clauses : 387
% 0.65/70.85 # Current number of unprocessed clauses: 40800
% 0.65/70.85 # ...number of literals in the above : 83116
% 0.65/70.85 # Current number of archived formulas : 0
% 0.65/70.85 # Current number of archived clauses : 425
% 0.65/70.85 # Clause-clause subsumption calls (NU) : 47363
% 0.65/70.85 # Rec. Clause-clause subsumption calls : 46776
% 0.65/70.85 # Non-unit clause-clause subsumptions : 7196
% 0.65/70.85 # Unit Clause-clause subsumption calls : 1628
% 0.65/70.85 # Rewrite failures with RHS unbound : 0
% 0.65/70.85 # BW rewrite match attempts : 1046
% 0.65/70.85 # BW rewrite match successes : 210
% 0.65/70.85 # Condensation attempts : 0
% 0.65/70.85 # Condensation successes : 0
% 0.65/70.85 # Termbank termtop insertions : 1487509
% 0.65/70.85
% 0.65/70.85 # -------------------------------------------------
% 0.65/70.85 # User time : 0.647 s
% 0.65/70.85 # System time : 0.020 s
% 0.65/70.85 # Total time : 0.667 s
% 0.65/70.85 # Maximum resident set size: 52976 pages
%------------------------------------------------------------------------------