TSTP Solution File: REL016+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL016+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 19:19:15 EDT 2022
% Result : Theorem 1.56s 212.72s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 64 unt; 0 def)
% Number of atoms : 64 ( 63 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 9 ( 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 : 119 ( 6 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
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/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(goals,conjecture,
! [X1,X2,X3] : meet(composition(X1,X2),complement(composition(X1,X3))) = meet(composition(X1,meet(X2,complement(X3))),complement(composition(X1,X3))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(c_0_11,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_12,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_13,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_16,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_19,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_20,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
fof(c_0_24,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_25,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_23]) ).
fof(c_0_27,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_28,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]),c_0_26]) ).
cnf(c_0_30,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
join(complement(X1),join(complement(X1),X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_33,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22]) ).
cnf(c_0_34,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_35,plain,
join(X1,complement(complement(X1))) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
fof(c_0_36,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_37,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_38,plain,
join(X1,complement(join(X2,join(complement(X1),X3)))) = X1,
inference(pm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
join(X1,join(complement(complement(X1)),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_40,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(pm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_43,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_44,negated_conjecture,
~ ! [X1,X2,X3] : meet(composition(X1,X2),complement(composition(X1,X3))) = meet(composition(X1,meet(X2,complement(X3))),complement(composition(X1,X3))),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_45,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_13,c_0_40]),c_0_41]),c_0_13]),c_0_13]),c_0_41]) ).
cnf(c_0_46,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_43]) ).
fof(c_0_48,negated_conjecture,
meet(composition(esk1_0,esk2_0),complement(composition(esk1_0,esk3_0))) != meet(composition(esk1_0,meet(esk2_0,complement(esk3_0))),complement(composition(esk1_0,esk3_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])]) ).
fof(c_0_49,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_50,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_45,c_0_17]) ).
cnf(c_0_51,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_32]),c_0_47]) ).
cnf(c_0_52,negated_conjecture,
meet(composition(esk1_0,esk2_0),complement(composition(esk1_0,esk3_0))) != meet(composition(esk1_0,meet(esk2_0,complement(esk3_0))),complement(composition(esk1_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_53,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_50,c_0_17]) ).
cnf(c_0_55,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(complement(composition(esk1_0,esk3_0))))) != complement(join(complement(composition(esk1_0,complement(join(complement(esk2_0),complement(complement(esk3_0)))))),complement(complement(composition(esk1_0,esk3_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53]),c_0_53]) ).
cnf(c_0_57,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
cnf(c_0_58,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(pm,[status(thm)],[c_0_55,c_0_22]) ).
cnf(c_0_59,negated_conjecture,
complement(join(complement(complement(composition(esk1_0,esk3_0))),complement(composition(esk1_0,complement(join(complement(esk2_0),complement(complement(esk3_0)))))))) != complement(join(complement(composition(esk1_0,esk2_0)),complement(complement(composition(esk1_0,esk3_0))))),
inference(rw,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_60,plain,
join(composition(X1,X2),composition(X1,complement(join(X2,X3)))) = join(composition(X1,X2),composition(X1,complement(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_57]) ).
cnf(c_0_61,negated_conjecture,
complement(join(composition(esk1_0,esk3_0),complement(composition(esk1_0,complement(join(esk3_0,complement(esk2_0))))))) != complement(join(complement(composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_47]),c_0_47]),c_0_22]),c_0_47]) ).
cnf(c_0_62,plain,
join(composition(X1,X2),complement(composition(X1,complement(join(X2,X3))))) = join(composition(X1,X2),complement(composition(X1,complement(X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_60]),c_0_58]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_47]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : REL016+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 14:07:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.38/23.40 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.47 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/46.45 eprover: CPU time limit exceeded, terminating
% 0.52/46.45 eprover: CPU time limit exceeded, terminating
% 0.52/46.49 eprover: CPU time limit exceeded, terminating
% 0.67/69.47 eprover: CPU time limit exceeded, terminating
% 0.67/69.49 eprover: CPU time limit exceeded, terminating
% 0.67/69.49 eprover: CPU time limit exceeded, terminating
% 0.67/69.51 eprover: CPU time limit exceeded, terminating
% 0.81/92.50 eprover: CPU time limit exceeded, terminating
% 0.81/92.52 eprover: CPU time limit exceeded, terminating
% 0.81/92.53 eprover: CPU time limit exceeded, terminating
% 0.81/92.54 eprover: CPU time limit exceeded, terminating
% 0.95/115.54 eprover: CPU time limit exceeded, terminating
% 0.95/115.55 eprover: CPU time limit exceeded, terminating
% 0.95/115.55 eprover: CPU time limit exceeded, terminating
% 0.95/115.56 eprover: CPU time limit exceeded, terminating
% 1.10/138.56 eprover: CPU time limit exceeded, terminating
% 1.10/138.58 eprover: CPU time limit exceeded, terminating
% 1.10/138.58 eprover: CPU time limit exceeded, terminating
% 1.10/138.62 eprover: CPU time limit exceeded, terminating
% 1.25/161.60 eprover: CPU time limit exceeded, terminating
% 1.25/161.61 eprover: CPU time limit exceeded, terminating
% 1.25/161.63 eprover: CPU time limit exceeded, terminating
% 1.25/161.64 eprover: CPU time limit exceeded, terminating
% 1.39/184.63 eprover: CPU time limit exceeded, terminating
% 1.39/184.64 eprover: CPU time limit exceeded, terminating
% 1.39/184.65 eprover: CPU time limit exceeded, terminating
% 1.39/184.66 eprover: CPU time limit exceeded, terminating
% 1.54/207.66 eprover: CPU time limit exceeded, terminating
% 1.54/207.67 eprover: CPU time limit exceeded, terminating
% 1.54/207.68 eprover: CPU time limit exceeded, terminating
% 1.54/207.68 eprover: CPU time limit exceeded, terminating
% 1.56/212.72 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # Preprocessing time : 0.014 s
% 1.56/212.72 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.56/212.72 # Preprocessing time : 0.010 s
% 1.56/212.72 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # Preprocessing time : 0.010 s
% 1.56/212.72 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # Preprocessing time : 0.015 s
% 1.56/212.72 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # Preprocessing time : 0.018 s
% 1.56/212.72 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.56/212.72 # Preprocessing time : 0.007 s
% 1.56/212.72 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.56/212.72 # Preprocessing time : 0.014 s
% 1.56/212.72 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # Preprocessing time : 0.007 s
% 1.56/212.72 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 1.56/212.72
% 1.56/212.72 # Failure: Resource limit exceeded (time)
% 1.56/212.72 # OLD status Res
% 1.56/212.72 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 1.56/212.72 # Preprocessing time : 0.007 s
% 1.56/212.72 # Running protocol protocol_eprover_4692c23f3ccd5aecc2adbd7957ddb4b4144a02c8 for 23 seconds:
% 1.56/212.72 # Preprocessing time : 0.007 s
% 1.56/212.72
% 1.56/212.72 # Proof found!
% 1.56/212.72 # SZS status Theorem
% 1.56/212.72 # SZS output start CNFRefutation
% See solution above
% 1.56/212.72 # Proof object total steps : 64
% 1.56/212.72 # Proof object clause steps : 41
% 1.56/212.72 # Proof object formula steps : 23
% 1.56/212.72 # Proof object conjectures : 8
% 1.56/212.72 # Proof object clause conjectures : 5
% 1.56/212.72 # Proof object formula conjectures : 3
% 1.56/212.72 # Proof object initial clauses used : 11
% 1.56/212.72 # Proof object initial formulas used : 11
% 1.56/212.72 # Proof object generating inferences : 23
% 1.56/212.72 # Proof object simplifying inferences : 26
% 1.56/212.72 # Training examples: 0 positive, 0 negative
% 1.56/212.72 # Parsed axioms : 17
% 1.56/212.72 # Removed by relevancy pruning/SinE : 0
% 1.56/212.72 # Initial clauses : 17
% 1.56/212.72 # Removed in clause preprocessing : 1
% 1.56/212.72 # Initial clauses in saturation : 16
% 1.56/212.72 # Processed clauses : 22652
% 1.56/212.72 # ...of these trivial : 14142
% 1.56/212.72 # ...subsumed : 7657
% 1.56/212.72 # ...remaining for further processing : 853
% 1.56/212.72 # Other redundant clauses eliminated : 0
% 1.56/212.72 # Clauses deleted for lack of memory : 105857
% 1.56/212.72 # Backward-subsumed : 0
% 1.56/212.72 # Backward-rewritten : 277
% 1.56/212.72 # Generated clauses : 417580
% 1.56/212.72 # ...of the previous two non-trivial : 241676
% 1.56/212.72 # Contextual simplify-reflections : 0
% 1.56/212.72 # Paramodulations : 417580
% 1.56/212.72 # Factorizations : 0
% 1.56/212.72 # Equation resolutions : 0
% 1.56/212.72 # Current number of processed clauses : 576
% 1.56/212.72 # Positive orientable unit clauses : 568
% 1.56/212.72 # Positive unorientable unit clauses: 8
% 1.56/212.72 # Negative unit clauses : 0
% 1.56/212.72 # Non-unit-clauses : 0
% 1.56/212.72 # Current number of unprocessed clauses: 73351
% 1.56/212.72 # ...number of literals in the above : 73351
% 1.56/212.72 # Current number of archived formulas : 0
% 1.56/212.72 # Current number of archived clauses : 278
% 1.56/212.72 # Clause-clause subsumption calls (NU) : 0
% 1.56/212.72 # Rec. Clause-clause subsumption calls : 0
% 1.56/212.72 # Non-unit clause-clause subsumptions : 0
% 1.56/212.72 # Unit Clause-clause subsumption calls : 25
% 1.56/212.72 # Rewrite failures with RHS unbound : 0
% 1.56/212.72 # BW rewrite match attempts : 12274
% 1.56/212.72 # BW rewrite match successes : 273
% 1.56/212.72 # Condensation attempts : 0
% 1.56/212.72 # Condensation successes : 0
% 1.56/212.72 # Termbank termtop insertions : 7886526
% 1.56/212.72
% 1.56/212.72 # -------------------------------------------------
% 1.56/212.72 # User time : 4.829 s
% 1.56/212.72 # System time : 0.107 s
% 1.56/212.72 # Total time : 4.936 s
% 1.56/212.72 # Maximum resident set size: 151668 pages
% 1.56/230.69 eprover: CPU time limit exceeded, terminating
% 1.56/230.70 eprover: CPU time limit exceeded, terminating
% 1.56/230.72 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.56/230.72 eprover: No such file or directory
% 1.56/230.72 eprover: CPU time limit exceeded, terminating
% 1.56/230.72 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.56/230.72 eprover: No such file or directory
% 1.56/230.72 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.56/230.72 eprover: No such file or directory
% 1.56/230.73 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.56/230.73 eprover: No such file or directory
% 1.56/230.74 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.56/230.74 eprover: No such file or directory
% 1.56/230.75 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.56/230.75 eprover: No such file or directory
%------------------------------------------------------------------------------