TSTP Solution File: HEN011-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HEN011-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:04 EDT 2023
% Result : Unsatisfiable 2.63s 0.84s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of clauses : 85 ( 70 unt; 0 nHn; 48 RR)
% Number of literals : 104 ( 77 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 81 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',less_equal_and_equal) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',identity_is_largest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',quotient_less_equal2) ).
cnf(identity_divide_b,hypothesis,
divide(identity,b) = d,
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',identity_divide_b) ).
cnf(identity_divide_d,hypothesis,
divide(identity,d) = g,
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',identity_divide_d) ).
cnf(identity_divide_a,hypothesis,
divide(identity,a) = c,
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',identity_divide_a) ).
cnf(identity_divide_c,hypothesis,
divide(identity,c) = e,
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',identity_divide_c) ).
cnf(prove_commutativity,negated_conjecture,
divide(c,g) != divide(d,e),
file('/export/starexec/sandbox2/tmp/tmp.4WXlpd66a5/E---3.1_10549.p',prove_commutativity) ).
cnf(c_0_12,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_13,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_14,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_15,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_17,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_18,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_19,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_20,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_23,hypothesis,
divide(identity,b) = d,
identity_divide_b ).
cnf(c_0_24,plain,
divide(X1,identity) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_25,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_26,plain,
( X1 = X2
| divide(X2,X1) != zero
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_27,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,hypothesis,
divide(identity,d) = g,
identity_divide_d ).
cnf(c_0_29,hypothesis,
divide(divide(X1,b),d) = zero,
inference(cn,[status(thm)],[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_22,c_0_23]),c_0_24]),c_0_21]),c_0_24]),c_0_21]),c_0_16])]) ).
cnf(c_0_30,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_31,plain,
divide(divide(X1,X1),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21])]) ).
cnf(c_0_32,hypothesis,
less_equal(divide(divide(X1,d),g),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_28]),c_0_24]),c_0_21]) ).
cnf(c_0_33,hypothesis,
divide(identity,a) = c,
identity_divide_a ).
cnf(c_0_34,hypothesis,
divide(divide(X1,d),divide(b,d)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_16])]) ).
cnf(c_0_35,plain,
( divide(divide(X1,X2),zero) = divide(divide(X1,zero),X2)
| ~ less_equal(divide(divide(X1,zero),X2),divide(divide(X1,X2),zero)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_36,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31])]) ).
cnf(c_0_37,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_38,hypothesis,
divide(divide(X1,d),g) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_32]),c_0_16])]) ).
cnf(c_0_39,hypothesis,
divide(divide(X1,a),c) = zero,
inference(cn,[status(thm)],[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_22,c_0_33]),c_0_24]),c_0_21]),c_0_24]),c_0_21]),c_0_16])]) ).
cnf(c_0_40,hypothesis,
divide(identity,c) = e,
identity_divide_c ).
cnf(c_0_41,plain,
( X1 = X2
| divide(X2,X1) != zero
| divide(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_42,hypothesis,
divide(g,divide(b,d)) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_43,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16])]) ).
cnf(c_0_44,hypothesis,
divide(divide(divide(X1,g),divide(d,g)),zero) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,hypothesis,
divide(divide(X1,c),divide(a,c)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_39]),c_0_16])]) ).
cnf(c_0_46,hypothesis,
less_equal(divide(divide(X1,c),e),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_40]),c_0_24]),c_0_21]) ).
cnf(c_0_47,hypothesis,
divide(b,d) = g,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38])]) ).
cnf(c_0_48,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_43]),c_0_43])]) ).
cnf(c_0_49,hypothesis,
divide(divide(X1,g),divide(d,g)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_44]),c_0_21])]) ).
cnf(c_0_50,hypothesis,
divide(e,divide(a,c)) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_51,hypothesis,
divide(divide(X1,c),e) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_46]),c_0_16])]) ).
cnf(c_0_52,plain,
divide(divide(X1,X2),divide(identity,X2)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_21]),c_0_21]),c_0_16])]) ).
cnf(c_0_53,hypothesis,
divide(g,b) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_47]) ).
cnf(c_0_54,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_15])]) ).
cnf(c_0_55,hypothesis,
( divide(d,g) = divide(X1,g)
| divide(divide(d,g),divide(X1,g)) != zero ),
inference(spm,[status(thm)],[c_0_41,c_0_49]) ).
cnf(c_0_56,hypothesis,
divide(a,c) = e,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_51])]) ).
cnf(c_0_57,hypothesis,
divide(divide(X1,e),divide(c,e)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_51]),c_0_16])]) ).
cnf(c_0_58,plain,
( divide(identity,X1) = divide(X2,X1)
| divide(divide(identity,X1),divide(X2,X1)) != zero ),
inference(spm,[status(thm)],[c_0_41,c_0_52]) ).
cnf(c_0_59,hypothesis,
divide(divide(X1,b),divide(divide(X1,g),b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_53]),c_0_54]) ).
cnf(c_0_60,hypothesis,
divide(d,g) = divide(identity,g),
inference(spm,[status(thm)],[c_0_55,c_0_52]) ).
cnf(c_0_61,hypothesis,
divide(e,a) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_62,hypothesis,
( divide(c,e) = divide(X1,e)
| divide(divide(c,e),divide(X1,e)) != zero ),
inference(spm,[status(thm)],[c_0_41,c_0_57]) ).
cnf(c_0_63,hypothesis,
divide(divide(identity,g),b) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_23]) ).
cnf(c_0_64,hypothesis,
less_equal(divide(identity,g),d),
inference(spm,[status(thm)],[c_0_13,c_0_60]) ).
cnf(c_0_65,hypothesis,
divide(divide(X1,a),divide(divide(X1,e),a)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_61]),c_0_54]) ).
cnf(c_0_66,hypothesis,
divide(c,e) = divide(identity,e),
inference(spm,[status(thm)],[c_0_62,c_0_52]) ).
cnf(c_0_67,plain,
divide(divide(divide(X1,X2),zero),divide(divide(X1,divide(X2,X3)),X2)) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_68,hypothesis,
divide(divide(divide(identity,X1),divide(c,X1)),divide(e,X1)) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_69,hypothesis,
divide(identity,g) = d,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_63]),c_0_64])]) ).
cnf(c_0_70,hypothesis,
divide(divide(identity,e),a) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_65]),c_0_33]) ).
cnf(c_0_71,hypothesis,
less_equal(divide(identity,e),c),
inference(spm,[status(thm)],[c_0_13,c_0_66]) ).
cnf(c_0_72,plain,
divide(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)) = zero,
inference(rw,[status(thm)],[c_0_67,c_0_54]) ).
cnf(c_0_73,hypothesis,
divide(divide(d,divide(c,g)),divide(e,g)) = zero,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,hypothesis,
divide(divide(divide(identity,X1),divide(d,X1)),divide(g,X1)) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_75,hypothesis,
divide(identity,e) = c,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_70]),c_0_71])]) ).
cnf(c_0_76,hypothesis,
divide(divide(d,divide(c,g)),e) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_21]),c_0_54]) ).
cnf(c_0_77,hypothesis,
divide(divide(c,divide(d,e)),divide(g,e)) = zero,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,hypothesis,
divide(divide(d,e),divide(divide(c,g),e)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_76]),c_0_16])]) ).
cnf(c_0_79,hypothesis,
divide(divide(c,divide(d,e)),g) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_77]),c_0_21]),c_0_54]) ).
cnf(c_0_80,hypothesis,
divide(divide(d,e),divide(c,g)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_78]),c_0_21]),c_0_54]) ).
cnf(c_0_81,negated_conjecture,
divide(c,g) != divide(d,e),
prove_commutativity ).
cnf(c_0_82,hypothesis,
divide(divide(c,g),divide(divide(d,e),g)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_79]),c_0_16])]) ).
cnf(c_0_83,hypothesis,
divide(divide(c,g),divide(d,e)) != zero,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_80]),c_0_81]) ).
cnf(c_0_84,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_82]),c_0_21]),c_0_54]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN011-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 11:19:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.4WXlpd66a5/E---3.1_10549.p
% 2.63/0.84 # Version: 3.1pre001
% 2.63/0.84 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.63/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.63/0.84 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.63/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.63/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.63/0.84 # Starting sh5l with 300s (1) cores
% 2.63/0.84 # sh5l with pid 10635 completed with status 0
% 2.63/0.84 # Result found by sh5l
% 2.63/0.84 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.63/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.63/0.84 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.63/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.63/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.63/0.84 # Starting sh5l with 300s (1) cores
% 2.63/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.63/0.84 # Search class: FHUSM-FFSS22-MFFFFFNN
% 2.63/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.63/0.84 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.63/0.84 # SAT001_MinMin_p005000_rr_RG with pid 10642 completed with status 0
% 2.63/0.84 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.63/0.84 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.63/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.63/0.84 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.63/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.63/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.63/0.84 # Starting sh5l with 300s (1) cores
% 2.63/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.63/0.84 # Search class: FHUSM-FFSS22-MFFFFFNN
% 2.63/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.63/0.84 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.63/0.84 # Preprocessing time : 0.001 s
% 2.63/0.84 # Presaturation interreduction done
% 2.63/0.84
% 2.63/0.84 # Proof found!
% 2.63/0.84 # SZS status Unsatisfiable
% 2.63/0.84 # SZS output start CNFRefutation
% See solution above
% 2.63/0.84 # Parsed axioms : 13
% 2.63/0.84 # Removed by relevancy pruning/SinE : 0
% 2.63/0.84 # Initial clauses : 13
% 2.63/0.84 # Removed in clause preprocessing : 0
% 2.63/0.84 # Initial clauses in saturation : 13
% 2.63/0.84 # Processed clauses : 2985
% 2.63/0.84 # ...of these trivial : 369
% 2.63/0.84 # ...subsumed : 1764
% 2.63/0.84 # ...remaining for further processing : 852
% 2.63/0.84 # Other redundant clauses eliminated : 0
% 2.63/0.84 # Clauses deleted for lack of memory : 0
% 2.63/0.84 # Backward-subsumed : 205
% 2.63/0.84 # Backward-rewritten : 254
% 2.63/0.84 # Generated clauses : 46469
% 2.63/0.84 # ...of the previous two non-redundant : 24571
% 2.63/0.84 # ...aggressively subsumed : 0
% 2.63/0.84 # Contextual simplify-reflections : 2
% 2.63/0.84 # Paramodulations : 46469
% 2.63/0.84 # Factorizations : 0
% 2.63/0.84 # NegExts : 0
% 2.63/0.84 # Equation resolutions : 0
% 2.63/0.84 # Total rewrite steps : 88653
% 2.63/0.84 # Propositional unsat checks : 0
% 2.63/0.84 # Propositional check models : 0
% 2.63/0.84 # Propositional check unsatisfiable : 0
% 2.63/0.84 # Propositional clauses : 0
% 2.63/0.84 # Propositional clauses after purity: 0
% 2.63/0.84 # Propositional unsat core size : 0
% 2.63/0.84 # Propositional preprocessing time : 0.000
% 2.63/0.84 # Propositional encoding time : 0.000
% 2.63/0.84 # Propositional solver time : 0.000
% 2.63/0.84 # Success case prop preproc time : 0.000
% 2.63/0.84 # Success case prop encoding time : 0.000
% 2.63/0.84 # Success case prop solver time : 0.000
% 2.63/0.84 # Current number of processed clauses : 381
% 2.63/0.84 # Positive orientable unit clauses : 242
% 2.63/0.84 # Positive unorientable unit clauses: 0
% 2.63/0.84 # Negative unit clauses : 5
% 2.63/0.84 # Non-unit-clauses : 134
% 2.63/0.84 # Current number of unprocessed clauses: 20170
% 2.63/0.84 # ...number of literals in the above : 34308
% 2.63/0.84 # Current number of archived formulas : 0
% 2.63/0.84 # Current number of archived clauses : 471
% 2.63/0.84 # Clause-clause subsumption calls (NU) : 16703
% 2.63/0.84 # Rec. Clause-clause subsumption calls : 16172
% 2.63/0.84 # Non-unit clause-clause subsumptions : 1756
% 2.63/0.84 # Unit Clause-clause subsumption calls : 1515
% 2.63/0.84 # Rewrite failures with RHS unbound : 0
% 2.63/0.84 # BW rewrite match attempts : 850
% 2.63/0.84 # BW rewrite match successes : 135
% 2.63/0.84 # Condensation attempts : 0
% 2.63/0.84 # Condensation successes : 0
% 2.63/0.84 # Termbank termtop insertions : 841010
% 2.63/0.84
% 2.63/0.84 # -------------------------------------------------
% 2.63/0.84 # User time : 0.315 s
% 2.63/0.84 # System time : 0.016 s
% 2.63/0.84 # Total time : 0.331 s
% 2.63/0.84 # Maximum resident set size: 1652 pages
% 2.63/0.84
% 2.63/0.84 # -------------------------------------------------
% 2.63/0.84 # User time : 0.315 s
% 2.63/0.84 # System time : 0.019 s
% 2.63/0.84 # Total time : 0.334 s
% 2.63/0.84 # Maximum resident set size: 1676 pages
% 2.63/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------