TSTP Solution File: SET634+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET634+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 00:52:45 EDT 2022
% Result : Theorem 1.74s 221.90s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 60 ( 23 unt; 0 def)
% Number of atoms : 128 ( 21 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 111 ( 43 ~; 52 |; 11 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 172 ( 17 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',difference_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',subset_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',intersection_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_of_intersection) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',equal_defn) ).
fof(prove_difference_and_intersection,conjecture,
! [X1,X2,X3] : intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',prove_difference_and_intersection) ).
fof(c_0_6,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[difference_defn])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_defn])])])])])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])])]) ).
cnf(c_0_9,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,plain,
( subset(X1,difference(X2,X3))
| member(esk3_2(X1,difference(X2,X3)),X3)
| ~ member(esk3_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( subset(difference(X1,X2),X3)
| member(esk3_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_20,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk3_2(X1,intersection(X2,X3)),X3)
| ~ member(esk3_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
fof(c_0_21,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_22,plain,
( subset(intersection(X1,X2),X3)
| member(esk3_2(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_23,plain,
( subset(intersection(X1,X2),X3)
| member(esk3_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_24,plain,
( subset(difference(X1,intersection(X2,X3)),X4)
| ~ member(esk3_2(difference(X1,intersection(X2,X3)),X4),X3)
| ~ member(esk3_2(difference(X1,intersection(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_25,plain,
( subset(difference(X1,X2),difference(X1,X3))
| member(esk3_2(difference(X1,X2),difference(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( subset(difference(X1,X2),intersection(X3,X1))
| ~ member(esk3_2(difference(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_27,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( subset(difference(X1,difference(X2,X3)),X4)
| member(esk3_2(difference(X1,difference(X2,X3)),X4),X3)
| ~ member(esk3_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_29,plain,
( subset(intersection(X1,X2),difference(X1,X3))
| member(esk3_2(intersection(X1,X2),difference(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_30,plain,
( subset(difference(difference(X1,X2),X3),X4)
| member(esk3_2(difference(difference(X1,X2),X3),X4),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_31,plain,
( subset(intersection(X1,X2),difference(X2,X3))
| member(esk3_2(intersection(X1,X2),difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
fof(c_0_32,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])])]) ).
cnf(c_0_33,plain,
( subset(difference(X1,intersection(X2,X3)),difference(X1,X3))
| ~ member(esk3_2(difference(X1,intersection(X2,X3)),difference(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( subset(difference(X1,X2),difference(X1,intersection(X3,X4)))
| member(esk3_2(difference(X1,X2),difference(X1,intersection(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_35,plain,
( subset(difference(X1,X2),intersection(X1,X3))
| ~ member(esk3_2(difference(X1,X2),intersection(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( subset(difference(X1,difference(X1,X2)),X3)
| member(esk3_2(difference(X1,difference(X1,X2)),X3),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_37,plain,
( subset(intersection(X1,X2),difference(X1,difference(X3,X4)))
| ~ member(esk3_2(intersection(X1,X2),difference(X1,difference(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_29]) ).
cnf(c_0_38,plain,
( subset(difference(difference(X1,X2),difference(X1,X3)),X4)
| member(esk3_2(difference(difference(X1,X2),difference(X1,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_39,plain,
( subset(intersection(X1,X2),difference(X2,difference(X3,X4)))
| ~ member(esk3_2(intersection(X1,X2),difference(X2,difference(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_31]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
subset(difference(X1,intersection(X1,X2)),difference(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_42,plain,
subset(difference(X1,X2),difference(X1,intersection(X3,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_43,plain,
subset(difference(X1,difference(X1,X2)),intersection(X1,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
subset(intersection(X1,X2),difference(X1,difference(X3,X2))),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_45,plain,
subset(difference(difference(X1,X2),difference(X1,X3)),intersection(X3,difference(X1,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_46,plain,
subset(intersection(X1,X2),difference(X2,difference(X3,X1))),
inference(spm,[status(thm)],[c_0_39,c_0_22]) ).
cnf(c_0_47,plain,
difference(X1,intersection(X1,X2)) = difference(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_48,plain,
difference(X1,difference(X1,X2)) = intersection(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_44])]) ).
cnf(c_0_49,plain,
difference(difference(X1,X2),difference(X1,X3)) = intersection(X3,difference(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_45]),c_0_46])]) ).
cnf(c_0_50,plain,
difference(X1,intersection(X2,X1)) = difference(X1,X2),
inference(spm,[status(thm)],[c_0_47,c_0_27]) ).
fof(c_0_51,negated_conjecture,
~ ! [X1,X2,X3] : intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),X3),
inference(assume_negation,[status(cth)],[prove_difference_and_intersection]) ).
cnf(c_0_52,plain,
intersection(difference(X1,X2),difference(X1,X3)) = difference(difference(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
fof(c_0_53,negated_conjecture,
intersection(esk4_0,difference(esk5_0,esk6_0)) != difference(intersection(esk4_0,esk5_0),esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_54,plain,
difference(difference(X1,X2),X3) = difference(difference(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_52]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
intersection(esk4_0,difference(esk5_0,esk6_0)) != difference(intersection(esk4_0,esk5_0),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,plain,
difference(intersection(X1,X2),X3) = intersection(X2,difference(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
intersection(esk5_0,difference(esk4_0,esk6_0)) != intersection(esk4_0,difference(esk5_0,esk6_0)),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,plain,
intersection(X1,difference(X2,X3)) = intersection(X2,difference(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_27]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET634+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 00:18:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.53/46.41 eprover: CPU time limit exceeded, terminating
% 0.53/46.42 eprover: CPU time limit exceeded, terminating
% 0.53/46.43 eprover: CPU time limit exceeded, terminating
% 0.53/46.43 eprover: CPU time limit exceeded, terminating
% 0.69/69.44 eprover: CPU time limit exceeded, terminating
% 0.69/69.44 eprover: CPU time limit exceeded, terminating
% 0.69/69.44 eprover: CPU time limit exceeded, terminating
% 0.69/69.44 eprover: CPU time limit exceeded, terminating
% 0.86/92.45 eprover: CPU time limit exceeded, terminating
% 0.86/92.46 eprover: CPU time limit exceeded, terminating
% 0.86/92.46 eprover: CPU time limit exceeded, terminating
% 0.86/92.46 eprover: CPU time limit exceeded, terminating
% 1.01/115.47 eprover: CPU time limit exceeded, terminating
% 1.01/115.47 eprover: CPU time limit exceeded, terminating
% 1.01/115.47 eprover: CPU time limit exceeded, terminating
% 1.01/115.48 eprover: CPU time limit exceeded, terminating
% 1.18/138.48 eprover: CPU time limit exceeded, terminating
% 1.18/138.49 eprover: CPU time limit exceeded, terminating
% 1.18/138.50 eprover: CPU time limit exceeded, terminating
% 1.18/138.51 eprover: CPU time limit exceeded, terminating
% 1.32/161.49 eprover: CPU time limit exceeded, terminating
% 1.32/161.50 eprover: CPU time limit exceeded, terminating
% 1.32/161.52 eprover: CPU time limit exceeded, terminating
% 1.32/161.54 eprover: CPU time limit exceeded, terminating
% 1.48/184.51 eprover: CPU time limit exceeded, terminating
% 1.48/184.51 eprover: CPU time limit exceeded, terminating
% 1.48/184.53 eprover: CPU time limit exceeded, terminating
% 1.48/184.56 eprover: CPU time limit exceeded, terminating
% 1.64/207.53 eprover: CPU time limit exceeded, terminating
% 1.64/207.55 eprover: CPU time limit exceeded, terminating
% 1.64/207.55 eprover: CPU time limit exceeded, terminating
% 1.64/207.58 eprover: CPU time limit exceeded, terminating
% 1.74/221.90 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # Preprocessing time : 0.016 s
% 1.74/221.90 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.74/221.90 # Preprocessing time : 0.007 s
% 1.74/221.90 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # Preprocessing time : 0.015 s
% 1.74/221.90 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # Preprocessing time : 0.008 s
% 1.74/221.90 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 1.74/221.90 # Preprocessing time : 0.008 s
% 1.74/221.90 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # Preprocessing time : 0.008 s
% 1.74/221.90 # Running protocol protocol_eprover_6017f334107ca4679a9978dd19d7c76a8bd36e48 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # SinE strategy is GSinE(CountFormulas,,1.4,,02,20000,1.0)
% 1.74/221.90 # Preprocessing time : 0.015 s
% 1.74/221.90 # Running protocol protocol_eprover_29f46a864b4eba32a7d0333eeab34cc2a3bfeeb2 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,04,500,1.0)
% 1.74/221.90 # Preprocessing time : 0.015 s
% 1.74/221.90 # Running protocol protocol_eprover_6c6e328223588bd61ac14315e52cd57432d78a40 for 23 seconds:
% 1.74/221.90
% 1.74/221.90 # Failure: Resource limit exceeded (time)
% 1.74/221.90 # OLD status Res
% 1.74/221.90 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,04,20000,1.0)
% 1.74/221.90 # Preprocessing time : 0.016 s
% 1.74/221.90 # Running protocol protocol_eprover_d060f57557112503de4e70311f17201fbe20b6a3 for 23 seconds:
% 1.74/221.90 # Preprocessing time : 0.008 s
% 1.74/221.90
% 1.74/221.90 # Proof found!
% 1.74/221.90 # SZS status Theorem
% 1.74/221.90 # SZS output start CNFRefutation
% See solution above
% 1.74/221.90 # Proof object total steps : 60
% 1.74/221.90 # Proof object clause steps : 47
% 1.74/221.90 # Proof object formula steps : 13
% 1.74/221.90 # Proof object conjectures : 6
% 1.74/221.90 # Proof object clause conjectures : 3
% 1.74/221.90 # Proof object formula conjectures : 3
% 1.74/221.90 # Proof object initial clauses used : 11
% 1.74/221.90 # Proof object initial formulas used : 6
% 1.74/221.90 # Proof object generating inferences : 34
% 1.74/221.90 # Proof object simplifying inferences : 13
% 1.74/221.90 # Training examples: 0 positive, 0 negative
% 1.74/221.90 # Parsed axioms : 9
% 1.74/221.90 # Removed by relevancy pruning/SinE : 0
% 1.74/221.90 # Initial clauses : 21
% 1.74/221.90 # Removed in clause preprocessing : 2
% 1.74/221.90 # Initial clauses in saturation : 19
% 1.74/221.90 # Processed clauses : 128864
% 1.74/221.90 # ...of these trivial : 2954
% 1.74/221.90 # ...subsumed : 123400
% 1.74/221.90 # ...remaining for further processing : 2510
% 1.74/221.90 # Other redundant clauses eliminated : 2
% 1.74/221.90 # Clauses deleted for lack of memory : 727882
% 1.74/221.90 # Backward-subsumed : 33
% 1.74/221.90 # Backward-rewritten : 1147
% 1.74/221.90 # Generated clauses : 1350302
% 1.74/221.90 # ...of the previous two non-trivial : 1169954
% 1.74/221.90 # Contextual simplify-reflections : 8982
% 1.74/221.90 # Paramodulations : 1349602
% 1.74/221.90 # Factorizations : 698
% 1.74/221.90 # Equation resolutions : 2
% 1.74/221.90 # Current number of processed clauses : 1328
% 1.74/221.90 # Positive orientable unit clauses : 175
% 1.74/221.90 # Positive unorientable unit clauses: 10
% 1.74/221.90 # Negative unit clauses : 15
% 1.74/221.90 # Non-unit-clauses : 1128
% 1.74/221.90 # Current number of unprocessed clauses: 50541
% 1.74/221.90 # ...number of literals in the above : 111039
% 1.74/221.90 # Current number of archived formulas : 0
% 1.74/221.90 # Current number of archived clauses : 1180
% 1.74/221.90 # Clause-clause subsumption calls (NU) : 1253554
% 1.74/221.90 # Rec. Clause-clause subsumption calls : 849978
% 1.74/221.90 # Non-unit clause-clause subsumptions : 23026
% 1.74/221.90 # Unit Clause-clause subsumption calls : 158890
% 1.74/221.90 # Rewrite failures with RHS unbound : 7870
% 1.74/221.90 # BW rewrite match attempts : 13159
% 1.74/221.90 # BW rewrite match successes : 1251
% 1.74/221.90 # Condensation attempts : 0
% 1.74/221.90 # Condensation successes : 0
% 1.74/221.90 # Termbank termtop insertions : 19613943
% 1.74/221.90
% 1.74/221.90 # -------------------------------------------------
% 1.74/221.90 # User time : 13.524 s
% 1.74/221.90 # System time : 0.157 s
% 1.74/221.90 # Total time : 13.681 s
% 1.74/221.90 # Maximum resident set size: 153340 pages
% 1.74/230.54 eprover: CPU time limit exceeded, terminating
% 1.74/230.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.74/230.55 eprover: No such file or directory
% 1.74/230.56 eprover: CPU time limit exceeded, terminating
% 1.74/230.56 eprover: CPU time limit exceeded, terminating
% 1.74/230.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.74/230.57 eprover: No such file or directory
% 1.74/230.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.74/230.58 eprover: No such file or directory
% 1.74/230.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.74/230.58 eprover: No such file or directory
% 1.74/230.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.74/230.59 eprover: No such file or directory
%------------------------------------------------------------------------------