TSTP Solution File: REL026+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL026+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:17 EDT 2023
% Result : Theorem 4.14s 0.97s
% Output : CNFRefutation 4.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 73 ( 68 unt; 0 def)
% Number of atoms : 81 ( 80 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 3 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 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 : 120 ( 3 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.nbDvLQkoMD/E---3.1_24538.p',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.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.nbDvLQkoMD/E---3.1_24538.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',maddux1_join_commutativity) ).
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.nbDvLQkoMD/E---3.1_24538.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.nbDvLQkoMD/E---3.1_24538.p',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',def_top) ).
fof(goals,conjecture,
! [X1,X2] :
( join(X1,one) = one
=> ( join(meet(composition(X1,top),X2),composition(X1,X2)) = composition(X1,X2)
& join(composition(X1,X2),meet(composition(X1,top),X2)) = meet(composition(X1,top),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',goals) ).
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.nbDvLQkoMD/E---3.1_24538.p',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',converse_additivity) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.nbDvLQkoMD/E---3.1_24538.p',maddux4_definiton_of_meet) ).
fof(c_0_12,plain,
! [X14,X15] : converse(composition(X14,X15)) = composition(converse(X15),converse(X14)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_13,plain,
! [X24] : composition(X24,one) = X24,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X27] : converse(converse(X27)) = X27,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_17,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X16,X17] : join(composition(converse(X16),complement(composition(X16,X17))),complement(X17)) = complement(X17),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_20,plain,
! [X19,X20] : join(X19,X20) = join(X20,X19),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_21,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
fof(c_0_25,plain,
! [X25,X26] : X25 = join(complement(join(complement(X25),complement(X26))),complement(join(complement(X25),X26))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_26,plain,
! [X21,X22,X23] : join(X21,join(X22,X23)) = join(join(X21,X22),X23),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_27,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_29,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X18] : top = join(X18,complement(X18)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_31,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24]),c_0_28]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_34,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
join(complement(X1),join(complement(X1),X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
join(complement(top),complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_34]),c_0_23]) ).
cnf(c_0_37,plain,
join(complement(top),X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
fof(c_0_40,negated_conjecture,
~ ! [X1,X2] :
( join(X1,one) = one
=> ( join(meet(composition(X1,top),X2),composition(X1,X2)) = composition(X1,X2)
& join(composition(X1,X2),meet(composition(X1,top),X2)) = meet(composition(X1,top),X2) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_41,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_23]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_23]) ).
fof(c_0_43,plain,
! [X11,X12,X13] : composition(join(X11,X12),X13) = join(composition(X11,X13),composition(X12,X13)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_44,plain,
! [X28,X29] : converse(join(X28,X29)) = join(converse(X28),converse(X29)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_45,negated_conjecture,
( join(esk1_0,one) = one
& ( join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,esk2_0)) != composition(esk1_0,esk2_0)
| join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0)) != meet(composition(esk1_0,top),esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])]) ).
cnf(c_0_46,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
join(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_46,c_0_38]) ).
cnf(c_0_51,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_14,c_0_47]),c_0_48]),c_0_14]),c_0_14]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
join(one,esk1_0) = one,
inference(rw,[status(thm)],[c_0_49,c_0_23]) ).
cnf(c_0_53,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_33]),c_0_38]),c_0_23]),c_0_31]),c_0_50]) ).
cnf(c_0_54,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_51,c_0_18]) ).
cnf(c_0_55,negated_conjecture,
join(X1,composition(esk1_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_52]),c_0_28]),c_0_28]) ).
cnf(c_0_56,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_53,c_0_38]) ).
cnf(c_0_57,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_54,c_0_18]) ).
cnf(c_0_58,negated_conjecture,
join(X1,join(composition(esk1_0,X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_59,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_56]),c_0_39]) ).
cnf(c_0_60,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_61,negated_conjecture,
join(complement(X1),complement(composition(esk1_0,X1))) = complement(composition(esk1_0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_55]),c_0_23]) ).
fof(c_0_62,plain,
! [X6,X7] : meet(X6,X7) = complement(join(complement(X6),complement(X7))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_63,negated_conjecture,
join(X1,complement(join(composition(esk1_0,X1),X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_58]) ).
cnf(c_0_64,plain,
join(composition(X1,X2),composition(X1,complement(X2))) = composition(X1,top),
inference(spm,[status(thm)],[c_0_60,c_0_34]) ).
cnf(c_0_65,negated_conjecture,
join(X1,complement(composition(esk1_0,complement(X1)))) = complement(composition(esk1_0,complement(X1))),
inference(spm,[status(thm)],[c_0_61,c_0_38]) ).
cnf(c_0_66,negated_conjecture,
( join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,esk2_0)) != composition(esk1_0,esk2_0)
| join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0)) != meet(composition(esk1_0,top),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_67,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_68,negated_conjecture,
complement(composition(esk1_0,complement(X1))) = join(X1,complement(composition(esk1_0,top))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top))))) != complement(join(complement(esk2_0),complement(composition(esk1_0,top))))
| join(composition(esk1_0,esk2_0),complement(join(complement(esk2_0),complement(composition(esk1_0,top))))) != composition(esk1_0,esk2_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)],[c_0_66,c_0_23]),c_0_67]),c_0_23]),c_0_67]),c_0_23]),c_0_67]),c_0_23]) ).
cnf(c_0_70,negated_conjecture,
complement(join(X1,complement(composition(esk1_0,top)))) = composition(esk1_0,complement(X1)),
inference(spm,[status(thm)],[c_0_38,c_0_68]) ).
cnf(c_0_71,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_38]) ).
cnf(c_0_72,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_38]),c_0_71]),c_0_70]),c_0_38]),c_0_70]),c_0_38]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : REL026+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 15:13:29 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.nbDvLQkoMD/E---3.1_24538.p
% 4.14/0.97 # Version: 3.1pre001
% 4.14/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.14/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.14/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.14/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.14/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.14/0.97 # Starting sh5l with 300s (1) cores
% 4.14/0.97 # new_bool_1 with pid 24617 completed with status 0
% 4.14/0.97 # Result found by new_bool_1
% 4.14/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.14/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.14/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.14/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.14/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.14/0.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.14/0.97 # Search class: FUHPM-FFSF21-MFFFFFNN
% 4.14/0.97 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.14/0.97 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 4.14/0.97 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 24624 completed with status 0
% 4.14/0.97 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 4.14/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.14/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.14/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.14/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.14/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.14/0.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.14/0.97 # Search class: FUHPM-FFSF21-MFFFFFNN
% 4.14/0.97 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.14/0.97 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 4.14/0.97 # Preprocessing time : 0.001 s
% 4.14/0.97
% 4.14/0.97 # Proof found!
% 4.14/0.97 # SZS status Theorem
% 4.14/0.97 # SZS output start CNFRefutation
% See solution above
% 4.14/0.97 # Parsed axioms : 14
% 4.14/0.97 # Removed by relevancy pruning/SinE : 1
% 4.14/0.97 # Initial clauses : 14
% 4.14/0.97 # Removed in clause preprocessing : 0
% 4.14/0.97 # Initial clauses in saturation : 14
% 4.14/0.97 # Processed clauses : 3592
% 4.14/0.97 # ...of these trivial : 2332
% 4.14/0.97 # ...subsumed : 720
% 4.14/0.97 # ...remaining for further processing : 540
% 4.14/0.97 # Other redundant clauses eliminated : 0
% 4.14/0.97 # Clauses deleted for lack of memory : 0
% 4.14/0.97 # Backward-subsumed : 0
% 4.14/0.97 # Backward-rewritten : 146
% 4.14/0.97 # Generated clauses : 64821
% 4.14/0.97 # ...of the previous two non-redundant : 30469
% 4.14/0.97 # ...aggressively subsumed : 0
% 4.14/0.97 # Contextual simplify-reflections : 0
% 4.14/0.97 # Paramodulations : 64821
% 4.14/0.97 # Factorizations : 0
% 4.14/0.97 # NegExts : 0
% 4.14/0.97 # Equation resolutions : 0
% 4.14/0.97 # Total rewrite steps : 119980
% 4.14/0.97 # Propositional unsat checks : 0
% 4.14/0.97 # Propositional check models : 0
% 4.14/0.97 # Propositional check unsatisfiable : 0
% 4.14/0.97 # Propositional clauses : 0
% 4.14/0.97 # Propositional clauses after purity: 0
% 4.14/0.97 # Propositional unsat core size : 0
% 4.14/0.97 # Propositional preprocessing time : 0.000
% 4.14/0.97 # Propositional encoding time : 0.000
% 4.14/0.97 # Propositional solver time : 0.000
% 4.14/0.97 # Success case prop preproc time : 0.000
% 4.14/0.97 # Success case prop encoding time : 0.000
% 4.14/0.97 # Success case prop solver time : 0.000
% 4.14/0.97 # Current number of processed clauses : 394
% 4.14/0.97 # Positive orientable unit clauses : 387
% 4.14/0.97 # Positive unorientable unit clauses: 7
% 4.14/0.97 # Negative unit clauses : 0
% 4.14/0.97 # Non-unit-clauses : 0
% 4.14/0.97 # Current number of unprocessed clauses: 26411
% 4.14/0.97 # ...number of literals in the above : 26411
% 4.14/0.97 # Current number of archived formulas : 0
% 4.14/0.97 # Current number of archived clauses : 146
% 4.14/0.97 # Clause-clause subsumption calls (NU) : 0
% 4.14/0.97 # Rec. Clause-clause subsumption calls : 0
% 4.14/0.97 # Non-unit clause-clause subsumptions : 0
% 4.14/0.97 # Unit Clause-clause subsumption calls : 22
% 4.14/0.97 # Rewrite failures with RHS unbound : 69
% 4.14/0.97 # BW rewrite match attempts : 3365
% 4.14/0.97 # BW rewrite match successes : 378
% 4.14/0.97 # Condensation attempts : 0
% 4.14/0.97 # Condensation successes : 0
% 4.14/0.97 # Termbank termtop insertions : 780844
% 4.14/0.97
% 4.14/0.97 # -------------------------------------------------
% 4.14/0.97 # User time : 0.496 s
% 4.14/0.97 # System time : 0.020 s
% 4.14/0.97 # Total time : 0.516 s
% 4.14/0.97 # Maximum resident set size: 1764 pages
% 4.14/0.97
% 4.14/0.97 # -------------------------------------------------
% 4.14/0.97 # User time : 0.496 s
% 4.14/0.97 # System time : 0.022 s
% 4.14/0.97 # Total time : 0.518 s
% 4.14/0.97 # Maximum resident set size: 1680 pages
% 4.14/0.97 % E---3.1 exiting
%------------------------------------------------------------------------------