TSTP Solution File: REL012+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL012+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:13:28 EDT 2023
% Result : Theorem 1.88s 0.67s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 10
% Syntax : Number of formulae : 88 ( 88 unt; 0 def)
% Number of atoms : 88 ( 87 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 131 ( 7 sgn; 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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.pTtyG0cUqJ/E---3.1_6367.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.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.pTtyG0cUqJ/E---3.1_6367.p',maddux4_definiton_of_meet) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p',maddux2_join_associativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p',converse_additivity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.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.pTtyG0cUqJ/E---3.1_6367.p',converse_cancellativity) ).
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p',converse_multiplicativity) ).
fof(goals,conjecture,
! [X1,X2] : join(composition(complement(composition(X1,X2)),converse(X2)),complement(X1)) = complement(X1),
file('/export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p',goals) ).
fof(c_0_10,plain,
! [X6,X7] : X6 = join(complement(join(complement(X6),complement(X7))),complement(join(complement(X6),X7))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_11,plain,
! [X12,X13] : join(X12,X13) = join(X13,X12),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_12,plain,
! [X37] : zero = meet(X37,complement(X37)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_13,plain,
! [X8,X9] : meet(X8,X9) = complement(join(complement(X8),complement(X9))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_14,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X14,X15,X16] : join(X14,join(X15,X16)) = join(join(X14,X15),X16),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_21,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_22,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_23,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_23]) ).
cnf(c_0_26,plain,
join(zero,join(complement(join(zero,zero)),X1)) = join(zero,join(complement(zero),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_23]) ).
cnf(c_0_27,plain,
join(zero,join(X1,complement(join(complement(X2),complement(X2))))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_28,plain,
join(complement(join(zero,zero)),X1) = join(complement(zero),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_29,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_28]),c_0_18]) ).
cnf(c_0_30,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_31,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_21]) ).
cnf(c_0_32,plain,
complement(join(complement(X1),complement(X1))) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_33,plain,
join(complement(X1),complement(complement(X1))) = join(zero,complement(zero)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_24]) ).
cnf(c_0_34,plain,
join(complement(X1),complement(X1)) = complement(join(X1,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_35,plain,
join(complement(X1),complement(complement(X1))) = complement(zero),
inference(rw,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_36,plain,
complement(complement(join(X1,X1))) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_37,plain,
join(X1,complement(X1)) = complement(zero),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,join(complement(X1),X2)) = join(complement(zero),X2),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,complement(join(X1,X1))) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_15]) ).
cnf(c_0_40,plain,
join(complement(zero),complement(X1)) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_39]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_42,plain,
join(complement(zero),X1) = complement(zero),
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_43,plain,
join(X1,complement(zero)) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_42]) ).
cnf(c_0_44,plain,
complement(complement(zero)) = zero,
inference(rw,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_45,plain,
complement(complement(X1)) = 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_18,c_0_43]),c_0_44]),c_0_44]),c_0_15]),c_0_31]),c_0_31]) ).
cnf(c_0_46,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_45]) ).
cnf(c_0_47,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_46]),c_0_23]),c_0_46]) ).
cnf(c_0_48,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_18]),c_0_15]) ).
cnf(c_0_49,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
fof(c_0_50,plain,
! [X20,X21] : converse(join(X20,X21)) = join(converse(X20),converse(X21)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_51,plain,
! [X36] : converse(converse(X36)) = X36,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_52,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_55,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_56,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_18]),c_0_45]) ).
cnf(c_0_58,plain,
join(X1,join(X2,complement(join(X1,X2)))) = complement(zero),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_59,plain,
join(X1,converse(complement(converse(X1)))) = converse(complement(zero)),
inference(spm,[status(thm)],[c_0_56,c_0_37]) ).
cnf(c_0_60,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_57,c_0_45]) ).
cnf(c_0_61,plain,
join(X1,join(X2,complement(join(X2,X1)))) = complement(zero),
inference(spm,[status(thm)],[c_0_25,c_0_58]) ).
cnf(c_0_62,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_63,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_52,c_0_45]) ).
cnf(c_0_64,plain,
converse(complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_59,c_0_42]) ).
cnf(c_0_65,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
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_60,c_0_61]),c_0_45]),c_0_62]),c_0_23]),c_0_15]),c_0_63]) ).
cnf(c_0_66,plain,
join(X1,converse(complement(converse(X1)))) = complement(zero),
inference(rw,[status(thm)],[c_0_59,c_0_64]) ).
cnf(c_0_67,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_45]),c_0_62]) ).
fof(c_0_68,plain,
! [X10,X11] : join(composition(converse(X10),complement(composition(X10,X11))),complement(X11)) = complement(X11),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
cnf(c_0_69,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_67]),c_0_54]),c_0_54]) ).
cnf(c_0_70,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_71,plain,
join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_69,c_0_45]) ).
cnf(c_0_72,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_70,c_0_15]) ).
cnf(c_0_73,plain,
complement(converse(complement(converse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_71]),c_0_45]),c_0_15]),c_0_67]) ).
fof(c_0_74,plain,
! [X34,X35] : converse(composition(X34,X35)) = composition(converse(X35),converse(X34)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_75,negated_conjecture,
~ ! [X1,X2] : join(composition(complement(composition(X1,X2)),converse(X2)),complement(X1)) = complement(X1),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_76,plain,
join(complement(X1),composition(X2,complement(composition(converse(X2),X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_72,c_0_54]) ).
cnf(c_0_77,plain,
converse(complement(converse(X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_45,c_0_73]) ).
cnf(c_0_78,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
fof(c_0_79,negated_conjecture,
join(composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0)),complement(esk1_0)) != complement(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])]) ).
cnf(c_0_80,plain,
join(X1,composition(X2,complement(composition(converse(X2),complement(X1))))) = X1,
inference(spm,[status(thm)],[c_0_76,c_0_45]) ).
cnf(c_0_81,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[c_0_54,c_0_77]) ).
cnf(c_0_82,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_78,c_0_54]) ).
cnf(c_0_83,negated_conjecture,
join(composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0)),complement(esk1_0)) != complement(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_84,plain,
join(X1,composition(complement(composition(complement(X1),X2)),converse(X2))) = 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_56,c_0_80]),c_0_54]),c_0_81]),c_0_78]),c_0_81]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
join(complement(esk1_0),composition(complement(composition(esk1_0,esk2_0)),converse(esk2_0))) != complement(esk1_0),
inference(rw,[status(thm)],[c_0_83,c_0_15]) ).
cnf(c_0_86,plain,
join(complement(X1),composition(complement(composition(X1,X2)),converse(X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_84,c_0_45]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : REL012+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 15:01:50 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.pTtyG0cUqJ/E---3.1_6367.p
% 1.88/0.67 # Version: 3.1pre001
% 1.88/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.88/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.88/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.88/0.67 # Starting sh5l with 300s (1) cores
% 1.88/0.67 # sh5l with pid 6449 completed with status 0
% 1.88/0.67 # Result found by sh5l
% 1.88/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.88/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.88/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.88/0.67 # Starting sh5l with 300s (1) cores
% 1.88/0.67 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.88/0.67 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1.88/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.88/0.67 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 163s (1) cores
% 1.88/0.67 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 6457 completed with status 0
% 1.88/0.67 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 1.88/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.88/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.88/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.88/0.67 # Starting sh5l with 300s (1) cores
% 1.88/0.67 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.88/0.67 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1.88/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.88/0.67 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 163s (1) cores
% 1.88/0.67 # Preprocessing time : 0.001 s
% 1.88/0.67 # Presaturation interreduction done
% 1.88/0.67
% 1.88/0.67 # Proof found!
% 1.88/0.67 # SZS status Theorem
% 1.88/0.67 # SZS output start CNFRefutation
% See solution above
% 1.88/0.67 # Parsed axioms : 17
% 1.88/0.67 # Removed by relevancy pruning/SinE : 2
% 1.88/0.67 # Initial clauses : 15
% 1.88/0.67 # Removed in clause preprocessing : 0
% 1.88/0.67 # Initial clauses in saturation : 15
% 1.88/0.67 # Processed clauses : 1643
% 1.88/0.67 # ...of these trivial : 936
% 1.88/0.67 # ...subsumed : 425
% 1.88/0.67 # ...remaining for further processing : 282
% 1.88/0.67 # Other redundant clauses eliminated : 0
% 1.88/0.67 # Clauses deleted for lack of memory : 0
% 1.88/0.67 # Backward-subsumed : 0
% 1.88/0.67 # Backward-rewritten : 89
% 1.88/0.67 # Generated clauses : 21877
% 1.88/0.67 # ...of the previous two non-redundant : 14471
% 1.88/0.67 # ...aggressively subsumed : 0
% 1.88/0.67 # Contextual simplify-reflections : 0
% 1.88/0.67 # Paramodulations : 21877
% 1.88/0.67 # Factorizations : 0
% 1.88/0.67 # NegExts : 0
% 1.88/0.67 # Equation resolutions : 0
% 1.88/0.67 # Total rewrite steps : 38867
% 1.88/0.67 # Propositional unsat checks : 0
% 1.88/0.67 # Propositional check models : 0
% 1.88/0.67 # Propositional check unsatisfiable : 0
% 1.88/0.67 # Propositional clauses : 0
% 1.88/0.67 # Propositional clauses after purity: 0
% 1.88/0.67 # Propositional unsat core size : 0
% 1.88/0.67 # Propositional preprocessing time : 0.000
% 1.88/0.67 # Propositional encoding time : 0.000
% 1.88/0.67 # Propositional solver time : 0.000
% 1.88/0.67 # Success case prop preproc time : 0.000
% 1.88/0.67 # Success case prop encoding time : 0.000
% 1.88/0.67 # Success case prop solver time : 0.000
% 1.88/0.67 # Current number of processed clauses : 178
% 1.88/0.67 # Positive orientable unit clauses : 174
% 1.88/0.67 # Positive unorientable unit clauses: 4
% 1.88/0.67 # Negative unit clauses : 0
% 1.88/0.67 # Non-unit-clauses : 0
% 1.88/0.67 # Current number of unprocessed clauses: 12294
% 1.88/0.67 # ...number of literals in the above : 12294
% 1.88/0.67 # Current number of archived formulas : 0
% 1.88/0.67 # Current number of archived clauses : 104
% 1.88/0.67 # Clause-clause subsumption calls (NU) : 0
% 1.88/0.67 # Rec. Clause-clause subsumption calls : 0
% 1.88/0.67 # Non-unit clause-clause subsumptions : 0
% 1.88/0.67 # Unit Clause-clause subsumption calls : 27
% 1.88/0.67 # Rewrite failures with RHS unbound : 0
% 1.88/0.67 # BW rewrite match attempts : 672
% 1.88/0.67 # BW rewrite match successes : 99
% 1.88/0.67 # Condensation attempts : 0
% 1.88/0.67 # Condensation successes : 0
% 1.88/0.67 # Termbank termtop insertions : 333896
% 1.88/0.67
% 1.88/0.67 # -------------------------------------------------
% 1.88/0.67 # User time : 0.222 s
% 1.88/0.67 # System time : 0.010 s
% 1.88/0.67 # Total time : 0.232 s
% 1.88/0.67 # Maximum resident set size: 1768 pages
% 1.88/0.67
% 1.88/0.67 # -------------------------------------------------
% 1.88/0.67 # User time : 0.223 s
% 1.88/0.67 # System time : 0.012 s
% 1.88/0.67 # Total time : 0.235 s
% 1.88/0.67 # Maximum resident set size: 1684 pages
% 1.88/0.67 % E---3.1 exiting
% 1.88/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------