TSTP Solution File: REL027+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL027+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 19:14:19 EDT 2023
% Result : Theorem 0.16s 0.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 69 ( 63 unt; 0 def)
% Number of atoms : 78 ( 77 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 4 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',def_top) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',converse_additivity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',maddux2_join_associativity) ).
fof(goals,conjecture,
! [X1] :
( join(X1,one) = one
=> ( join(meet(complement(composition(X1,top)),one),meet(complement(X1),one)) = meet(complement(X1),one)
& join(meet(complement(X1),one),meet(complement(composition(X1,top)),one)) = meet(complement(composition(X1,top)),one) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4EnPUkkMX8/E---3.1_15904.p',goals) ).
fof(c_0_13,plain,
! [X20,X21] : converse(composition(X20,X21)) = composition(converse(X21),converse(X20)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X8] : composition(X8,one) = X8,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_15,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X29] : converse(converse(X29)) = X29,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_18,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X11,X12] : join(composition(converse(X11),complement(composition(X11,X12))),complement(X12)) = complement(X12),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_21,plain,
! [X22,X23] : join(X22,X23) = join(X23,X22),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_22,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
fof(c_0_26,plain,
! [X7] : zero = meet(X7,complement(X7)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_27,plain,
! [X5,X6] : meet(X5,X6) = complement(join(complement(X5),complement(X6))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_28,plain,
! [X13] : top = join(X13,complement(X13)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_29,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_30,plain,
! [X27,X28] : converse(join(X27,X28)) = join(converse(X27),converse(X28)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_31,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_33,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_36,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_37,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_39,plain,
! [X24,X25,X26] : join(X24,join(X25,X26)) = join(join(X24,X25),X26),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_40,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25]),c_0_32]) ).
cnf(c_0_41,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_42,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_43,negated_conjecture,
~ ! [X1] :
( join(X1,one) = one
=> ( join(meet(complement(composition(X1,top)),one),meet(complement(X1),one)) = meet(complement(X1),one)
& join(meet(complement(X1),one),meet(complement(composition(X1,top)),one)) = meet(complement(composition(X1,top)),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_44,plain,
composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_38]),c_0_15]),c_0_15]),c_0_38]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_24]) ).
fof(c_0_48,negated_conjecture,
( join(esk1_0,one) = one
& ( join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one)) != meet(complement(esk1_0),one)
| join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one)) != meet(complement(composition(esk1_0,top)),one) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).
cnf(c_0_49,plain,
composition(converse(X1),join(one,converse(X2))) = join(converse(X1),composition(converse(X1),converse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_25]),c_0_16]),c_0_24]),c_0_24]) ).
cnf(c_0_50,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_35]),c_0_41]),c_0_24]) ).
cnf(c_0_52,negated_conjecture,
join(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_53,plain,
composition(X1,join(one,converse(X2))) = join(X1,composition(X1,converse(X2))),
inference(spm,[status(thm)],[c_0_49,c_0_19]) ).
cnf(c_0_54,plain,
join(composition(X1,X2),composition(complement(X1),X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_55,negated_conjecture,
( join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one)) != meet(complement(esk1_0),one)
| join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one)) != meet(complement(composition(esk1_0,top)),one) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_45]) ).
cnf(c_0_58,negated_conjecture,
join(X1,composition(esk1_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_52]),c_0_32]),c_0_24]),c_0_32]) ).
cnf(c_0_59,plain,
composition(X1,join(one,X2)) = join(X1,composition(X1,X2)),
inference(spm,[status(thm)],[c_0_53,c_0_19]) ).
cnf(c_0_60,plain,
join(X1,composition(complement(one),X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_54,c_0_32]) ).
cnf(c_0_61,negated_conjecture,
( join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top)))))) != complement(join(complement(one),complement(complement(composition(esk1_0,top)))))
| join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top)))))) != complement(join(complement(one),complement(complement(esk1_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_24]),c_0_34]),c_0_24]),c_0_34]),c_0_24]),c_0_34]),c_0_24]),c_0_34]),c_0_24]),c_0_34]),c_0_24]),c_0_34]),c_0_24]) ).
cnf(c_0_62,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
join(X1,join(X2,composition(esk1_0,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
join(X1,composition(X1,complement(one))) = composition(X1,top),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_16]),c_0_16]) ).
cnf(c_0_65,negated_conjecture,
( join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top)))) != complement(join(complement(one),composition(esk1_0,top)))
| join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top)))) != complement(join(esk1_0,complement(one))) ),
inference(rw,[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_61,c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_66,negated_conjecture,
join(complement(one),composition(esk1_0,top)) = join(esk1_0,complement(one)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_66]),c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : REL027+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 15:11:16 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.4EnPUkkMX8/E---3.1_15904.p
% 0.16/0.55 # Version: 3.1pre001
% 0.16/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 # Starting sh5l with 300s (1) cores
% 0.16/0.55 # sh5l with pid 15984 completed with status 0
% 0.16/0.55 # Result found by sh5l
% 0.16/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 # Starting sh5l with 300s (1) cores
% 0.16/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.55 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.16/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.55 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.16/0.55 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 15992 completed with status 0
% 0.16/0.55 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.16/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 # Starting sh5l with 300s (1) cores
% 0.16/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.55 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.16/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.55 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.16/0.55 # Preprocessing time : 0.001 s
% 0.16/0.55
% 0.16/0.55 # Proof found!
% 0.16/0.55 # SZS status Theorem
% 0.16/0.55 # SZS output start CNFRefutation
% See solution above
% 0.16/0.55 # Parsed axioms : 14
% 0.16/0.55 # Removed by relevancy pruning/SinE : 0
% 0.16/0.55 # Initial clauses : 15
% 0.16/0.55 # Removed in clause preprocessing : 0
% 0.16/0.55 # Initial clauses in saturation : 15
% 0.16/0.55 # Processed clauses : 1149
% 0.16/0.55 # ...of these trivial : 657
% 0.16/0.55 # ...subsumed : 191
% 0.16/0.55 # ...remaining for further processing : 301
% 0.16/0.55 # Other redundant clauses eliminated : 0
% 0.16/0.55 # Clauses deleted for lack of memory : 0
% 0.16/0.55 # Backward-subsumed : 0
% 0.16/0.55 # Backward-rewritten : 52
% 0.16/0.55 # Generated clauses : 16379
% 0.16/0.55 # ...of the previous two non-redundant : 7280
% 0.16/0.55 # ...aggressively subsumed : 0
% 0.16/0.55 # Contextual simplify-reflections : 0
% 0.16/0.55 # Paramodulations : 16379
% 0.16/0.55 # Factorizations : 0
% 0.16/0.55 # NegExts : 0
% 0.16/0.55 # Equation resolutions : 0
% 0.16/0.55 # Total rewrite steps : 27500
% 0.16/0.55 # Propositional unsat checks : 0
% 0.16/0.55 # Propositional check models : 0
% 0.16/0.55 # Propositional check unsatisfiable : 0
% 0.16/0.55 # Propositional clauses : 0
% 0.16/0.55 # Propositional clauses after purity: 0
% 0.16/0.55 # Propositional unsat core size : 0
% 0.16/0.55 # Propositional preprocessing time : 0.000
% 0.16/0.55 # Propositional encoding time : 0.000
% 0.16/0.55 # Propositional solver time : 0.000
% 0.16/0.55 # Success case prop preproc time : 0.000
% 0.16/0.55 # Success case prop encoding time : 0.000
% 0.16/0.55 # Success case prop solver time : 0.000
% 0.16/0.55 # Current number of processed clauses : 249
% 0.16/0.55 # Positive orientable unit clauses : 244
% 0.16/0.55 # Positive unorientable unit clauses: 4
% 0.16/0.55 # Negative unit clauses : 0
% 0.16/0.55 # Non-unit-clauses : 1
% 0.16/0.55 # Current number of unprocessed clauses: 6012
% 0.16/0.55 # ...number of literals in the above : 6012
% 0.16/0.55 # Current number of archived formulas : 0
% 0.16/0.55 # Current number of archived clauses : 52
% 0.16/0.55 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.55 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.55 # Non-unit clause-clause subsumptions : 1
% 0.16/0.55 # Unit Clause-clause subsumption calls : 18
% 0.16/0.55 # Rewrite failures with RHS unbound : 0
% 0.16/0.55 # BW rewrite match attempts : 866
% 0.16/0.55 # BW rewrite match successes : 241
% 0.16/0.55 # Condensation attempts : 0
% 0.16/0.55 # Condensation successes : 0
% 0.16/0.55 # Termbank termtop insertions : 159569
% 0.16/0.55
% 0.16/0.55 # -------------------------------------------------
% 0.16/0.55 # User time : 0.106 s
% 0.16/0.55 # System time : 0.009 s
% 0.16/0.55 # Total time : 0.115 s
% 0.16/0.55 # Maximum resident set size: 1748 pages
% 0.16/0.55
% 0.16/0.55 # -------------------------------------------------
% 0.16/0.55 # User time : 0.107 s
% 0.16/0.55 # System time : 0.011 s
% 0.16/0.55 # Total time : 0.118 s
% 0.16/0.55 # Maximum resident set size: 1676 pages
% 0.16/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------