TSTP Solution File: FLD022-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD022-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:30:31 EDT 2023
% Result : Unsatisfiable 57.76s 7.88s
% Output : CNFRefutation 57.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 14
% Syntax : Number of clauses : 74 ( 32 unt; 0 nHn; 74 RR)
% Number of literals : 156 ( 0 equ; 84 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_addition,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',associativity_addition) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',c_is_defined) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',compatibility_of_equality_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',existence_of_inverse_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',b_is_defined) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',existence_of_identity_addition) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',transitivity_of_equality) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',well_definedness_of_additive_inverse) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',symmetry_of_equality) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',commutativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',well_definedness_of_addition) ).
cnf(add_equals_add_4,negated_conjecture,
equalish(add(a,c),add(b,c)),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',add_equals_add_4) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',a_is_defined) ).
cnf(a_not_equal_to_b_5,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p',a_not_equal_to_b_5) ).
cnf(c_0_14,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_addition ).
cnf(c_0_15,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_16,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_17,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_18,hypothesis,
( equalish(add(c,add(X1,X2)),add(add(c,X1),X2))
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_20,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_21,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_22,plain,
( equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2))
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
( equalish(add(c,add(X1,b)),add(add(c,X1),b))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_25,hypothesis,
equalish(add(additive_identity,b),b),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,plain,
( equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
( equalish(add(c,add(additive_inverse(X1),b)),add(add(c,additive_inverse(X1)),b))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_29,hypothesis,
equalish(add(c,add(additive_inverse(c),b)),add(additive_identity,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_15])]) ).
cnf(c_0_30,plain,
( equalish(add(X1,add(additive_inverse(X2),X3)),add(add(X1,additive_inverse(X2)),X3))
| ~ defined(X3)
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_31,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_32,hypothesis,
equalish(add(c,add(additive_inverse(c),b)),b),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( equalish(X1,add(add(X2,additive_inverse(X3)),X4))
| ~ defined(X4)
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,add(X2,add(additive_inverse(X3),X4))) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_34,hypothesis,
equalish(b,add(c,add(additive_inverse(c),b))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,hypothesis,
equalish(b,add(add(c,additive_inverse(c)),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19]),c_0_15])]) ).
cnf(c_0_36,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_37,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_addition ).
cnf(c_0_38,hypothesis,
equalish(add(add(c,additive_inverse(c)),b),b),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_39,plain,
( equalish(add(X1,add(X2,X3)),add(add(X2,X3),X1))
| ~ defined(X1)
| ~ defined(X3)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(add(c,additive_inverse(c)),b)) ),
inference(spm,[status(thm)],[c_0_21,c_0_38]) ).
cnf(c_0_41,plain,
( equalish(add(X1,add(X2,additive_inverse(X3))),add(add(X2,additive_inverse(X3)),X1))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_42,plain,
( equalish(add(X1,add(X2,additive_inverse(X3))),add(add(X1,X2),additive_inverse(X3)))
| ~ defined(X2)
| ~ defined(X1)
| ~ defined(X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_43,hypothesis,
equalish(add(b,add(c,additive_inverse(c))),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_19]),c_0_15])]) ).
cnf(c_0_44,plain,
( equalish(X1,add(add(X2,X3),additive_inverse(X4)))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X4)
| ~ equalish(X1,add(X2,add(X3,additive_inverse(X4)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_42]) ).
cnf(c_0_45,hypothesis,
equalish(b,add(b,add(c,additive_inverse(c)))),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_46,hypothesis,
equalish(b,add(add(b,c),additive_inverse(c))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_15]),c_0_19])]) ).
cnf(c_0_47,negated_conjecture,
equalish(add(a,c),add(b,c)),
add_equals_add_4 ).
cnf(c_0_48,hypothesis,
equalish(add(add(b,c),additive_inverse(c)),b),
inference(spm,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( equalish(add(add(a,c),X1),add(add(b,c),X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_50,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(add(b,c),additive_inverse(c))) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( equalish(add(add(a,c),additive_inverse(X1)),add(add(b,c),additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_52,plain,
( equalish(add(X1,additive_inverse(X2)),add(additive_inverse(X2),X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_53,negated_conjecture,
equalish(add(add(a,c),additive_inverse(c)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_15])]) ).
cnf(c_0_54,plain,
( equalish(X1,add(additive_inverse(X2),X3))
| ~ defined(X3)
| ~ defined(X2)
| ~ equalish(X1,add(X3,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
equalish(b,add(add(a,c),additive_inverse(c))),
inference(spm,[status(thm)],[c_0_31,c_0_53]) ).
cnf(c_0_56,plain,
( equalish(add(additive_inverse(X1),add(X2,X3)),add(add(additive_inverse(X1),X2),X3))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_57,negated_conjecture,
( equalish(b,add(additive_inverse(c),add(a,c)))
| ~ defined(add(a,c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_15])]) ).
cnf(c_0_58,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_59,plain,
( equalish(X1,add(add(additive_inverse(X2),X3),X4))
| ~ defined(X4)
| ~ defined(X3)
| ~ defined(X2)
| ~ equalish(X1,add(additive_inverse(X2),add(X3,X4))) ),
inference(spm,[status(thm)],[c_0_21,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
equalish(b,add(additive_inverse(c),add(a,c))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_37]),c_0_15]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
equalish(b,add(add(additive_inverse(c),a),c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_15]),c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
equalish(add(add(additive_inverse(c),a),c),b),
inference(spm,[status(thm)],[c_0_31,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( equalish(X1,b)
| ~ equalish(X1,add(add(additive_inverse(c),a),c)) ),
inference(spm,[status(thm)],[c_0_21,c_0_62]) ).
cnf(c_0_64,plain,
( equalish(add(X1,add(additive_inverse(X2),X3)),add(add(additive_inverse(X2),X3),X1))
| ~ defined(X1)
| ~ defined(X3)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_65,negated_conjecture,
equalish(add(c,add(additive_inverse(c),a)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_15]),c_0_58])]) ).
cnf(c_0_66,negated_conjecture,
equalish(b,add(c,add(additive_inverse(c),a))),
inference(spm,[status(thm)],[c_0_31,c_0_65]) ).
cnf(c_0_67,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_68,negated_conjecture,
equalish(b,add(add(c,additive_inverse(c)),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_66]),c_0_58]),c_0_15])]) ).
cnf(c_0_69,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
equalish(b,add(additive_identity,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_68]),c_0_58]),c_0_15])]) ).
cnf(c_0_71,hypothesis,
equalish(b,a),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,negated_conjecture,
~ equalish(a,b),
a_not_equal_to_b_5 ).
cnf(c_0_73,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_71]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : FLD022-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n001.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 23:44:37 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.zY7SUJtvAY/E---3.1_27576.p
% 57.76/7.88 # Version: 3.1pre001
% 57.76/7.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 57.76/7.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.76/7.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 57.76/7.88 # Starting new_bool_3 with 300s (1) cores
% 57.76/7.88 # Starting new_bool_1 with 300s (1) cores
% 57.76/7.88 # Starting sh5l with 300s (1) cores
% 57.76/7.88 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27724 completed with status 0
% 57.76/7.88 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 57.76/7.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 57.76/7.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.76/7.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 57.76/7.88 # No SInE strategy applied
% 57.76/7.88 # Search class: FGUNF-FFMM21-SFFFFFNN
% 57.76/7.88 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 57.76/7.88 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 57.76/7.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 57.76/7.88 # Starting new_bool_3 with 269s (1) cores
% 57.76/7.88 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 57.76/7.88 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 57.76/7.88 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 27736 completed with status 0
% 57.76/7.88 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 57.76/7.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 57.76/7.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.76/7.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 57.76/7.88 # No SInE strategy applied
% 57.76/7.88 # Search class: FGUNF-FFMM21-SFFFFFNN
% 57.76/7.88 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 57.76/7.88 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 57.76/7.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 57.76/7.88 # Starting new_bool_3 with 269s (1) cores
% 57.76/7.88 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 57.76/7.88 # Preprocessing time : 0.001 s
% 57.76/7.88 # Presaturation interreduction done
% 57.76/7.88
% 57.76/7.88 # Proof found!
% 57.76/7.88 # SZS status Unsatisfiable
% 57.76/7.88 # SZS output start CNFRefutation
% See solution above
% 57.76/7.88 # Parsed axioms : 32
% 57.76/7.88 # Removed by relevancy pruning/SinE : 0
% 57.76/7.88 # Initial clauses : 32
% 57.76/7.88 # Removed in clause preprocessing : 0
% 57.76/7.88 # Initial clauses in saturation : 32
% 57.76/7.88 # Processed clauses : 39269
% 57.76/7.88 # ...of these trivial : 17931
% 57.76/7.88 # ...subsumed : 3090
% 57.76/7.88 # ...remaining for further processing : 18248
% 57.76/7.88 # Other redundant clauses eliminated : 0
% 57.76/7.88 # Clauses deleted for lack of memory : 0
% 57.76/7.88 # Backward-subsumed : 14
% 57.76/7.88 # Backward-rewritten : 23
% 57.76/7.88 # Generated clauses : 333236
% 57.76/7.88 # ...of the previous two non-redundant : 261235
% 57.76/7.88 # ...aggressively subsumed : 0
% 57.76/7.88 # Contextual simplify-reflections : 95
% 57.76/7.88 # Paramodulations : 333226
% 57.76/7.88 # Factorizations : 10
% 57.76/7.88 # NegExts : 0
% 57.76/7.88 # Equation resolutions : 0
% 57.76/7.88 # Total rewrite steps : 191814
% 57.76/7.88 # Propositional unsat checks : 0
% 57.76/7.88 # Propositional check models : 0
% 57.76/7.88 # Propositional check unsatisfiable : 0
% 57.76/7.88 # Propositional clauses : 0
% 57.76/7.88 # Propositional clauses after purity: 0
% 57.76/7.88 # Propositional unsat core size : 0
% 57.76/7.88 # Propositional preprocessing time : 0.000
% 57.76/7.88 # Propositional encoding time : 0.000
% 57.76/7.88 # Propositional solver time : 0.000
% 57.76/7.88 # Success case prop preproc time : 0.000
% 57.76/7.88 # Success case prop encoding time : 0.000
% 57.76/7.88 # Success case prop solver time : 0.000
% 57.76/7.88 # Current number of processed clauses : 18179
% 57.76/7.88 # Positive orientable unit clauses : 10381
% 57.76/7.88 # Positive unorientable unit clauses: 0
% 57.76/7.88 # Negative unit clauses : 2
% 57.76/7.88 # Non-unit-clauses : 7796
% 57.76/7.88 # Current number of unprocessed clauses: 222018
% 57.76/7.88 # ...number of literals in the above : 763520
% 57.76/7.88 # Current number of archived formulas : 0
% 57.76/7.88 # Current number of archived clauses : 69
% 57.76/7.88 # Clause-clause subsumption calls (NU) : 3645711
% 57.76/7.88 # Rec. Clause-clause subsumption calls : 2410231
% 57.76/7.88 # Non-unit clause-clause subsumptions : 3199
% 57.76/7.88 # Unit Clause-clause subsumption calls : 800507
% 57.76/7.88 # Rewrite failures with RHS unbound : 0
% 57.76/7.88 # BW rewrite match attempts : 399807
% 57.76/7.88 # BW rewrite match successes : 23
% 57.76/7.88 # Condensation attempts : 0
% 57.76/7.88 # Condensation successes : 0
% 57.76/7.88 # Termbank termtop insertions : 6005472
% 57.76/7.88
% 57.76/7.88 # -------------------------------------------------
% 57.76/7.88 # User time : 7.012 s
% 57.76/7.88 # System time : 0.250 s
% 57.76/7.88 # Total time : 7.261 s
% 57.76/7.88 # Maximum resident set size: 1652 pages
% 57.76/7.88
% 57.76/7.88 # -------------------------------------------------
% 57.76/7.88 # User time : 34.588 s
% 57.76/7.88 # System time : 0.871 s
% 57.76/7.88 # Total time : 35.459 s
% 57.76/7.88 # Maximum resident set size: 1696 pages
% 57.76/7.88 % E---3.1 exiting
%------------------------------------------------------------------------------