TSTP Solution File: GRP667+6 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP667+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : Sat Jul 16 09:03:13 EDT 2022
% Result : Theorem 0.59s 70.77s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 10
% Syntax : Number of formulae : 85 ( 82 unt; 0 def)
% Number of atoms : 94 ( 93 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 6 ~; 6 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 190 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f08,axiom,
! [X1,X2] : mult(mult(X2,X1),X2) = mult(X2,mult(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f08) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f01) ).
fof(f07,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(mult(X3,X1),X3)) = mult(mult(X2,mult(mult(X1,X3),X1)),X3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f07) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f02) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f05) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f04) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f06) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f03) ).
fof(f09,axiom,
! [X2] : mult(f(X2),f(X2)) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f09) ).
fof(goals,conjecture,
( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
| ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
| ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
| ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(c_0_10,plain,
! [X3,X4] : mult(mult(X4,X3),X4) = mult(X4,mult(X3,X4)),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_11,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_12,plain,
! [X4,X5,X6] : mult(mult(X6,X5),mult(mult(X4,X5),X4)) = mult(mult(X6,mult(mult(X5,X4),X5)),X4),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_13,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_14,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X3] : mult(X3,unit) = X3,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_17,plain,
! [X3,X4] : rd(mult(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_18,plain,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X3] : mult(unit,X3) = X3,
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_22,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X3,X4] : mult(rd(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_25,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14]) ).
cnf(c_0_26,plain,
ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_29,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_30,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_32,plain,
mult(ld(X1,unit),X1) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
mult(ld(X1,unit),mult(X1,mult(X2,X1))) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_33]),c_0_23]) ).
cnf(c_0_35,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_36,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_22]),c_0_27]),c_0_27]) ).
cnf(c_0_37,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_15]) ).
cnf(c_0_38,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_39,plain,
mult(mult(X1,mult(X2,X1)),X2) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_27]) ).
cnf(c_0_40,plain,
mult(rd(X1,X2),mult(X2,rd(X1,X2))) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_41,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_42,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_43,plain,
mult(mult(X1,rd(X1,X2)),X2) = mult(rd(X1,X2),mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30]) ).
cnf(c_0_44,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_46,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_47,plain,
mult(mult(X1,rd(X1,X2)),X2) = mult(X1,X1),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
ld(rd(X1,X2),unit) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_49,plain,
rd(mult(X1,X2),mult(X2,X2)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_50,plain,
rd(mult(X1,X1),X2) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_51,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_48]),c_0_50]),c_0_45]) ).
cnf(c_0_52,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_53,plain,
rd(X1,ld(X2,unit)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_42]),c_0_52]) ).
cnf(c_0_54,plain,
mult(mult(X1,mult(X2,X3)),rd(X3,X2)) = mult(mult(X1,X2),mult(X3,rd(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_40]) ).
cnf(c_0_55,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
fof(c_0_56,plain,
! [X3] : mult(f(X3),f(X3)) = X3,
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_57,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_42,c_0_53]) ).
cnf(c_0_58,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_41]),c_0_55]),c_0_15]),c_0_55]) ).
cnf(c_0_59,plain,
mult(f(X1),f(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_60,plain,
ld(ld(X1,X2),unit) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_15]) ).
cnf(c_0_61,plain,
mult(mult(X1,mult(X2,X3)),ld(X3,X2)) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_15]) ).
cnf(c_0_62,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_59]) ).
cnf(c_0_64,plain,
ld(ld(X1,X2),X3) = mult(ld(X2,X1),X3),
inference(spm,[status(thm)],[c_0_37,c_0_60]) ).
cnf(c_0_65,plain,
ld(X1,rd(X1,X2)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_19,c_0_51]) ).
cnf(c_0_66,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,X2)),
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_57]),c_0_51]),c_0_57]),c_0_37]),c_0_61]),c_0_63]) ).
cnf(c_0_67,plain,
rd(X1,ld(X2,X3)) = mult(X1,ld(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_64]),c_0_22]) ).
cnf(c_0_68,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_69,plain,
rd(ld(X1,X2),X2) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_70,plain,
ld(mult(X1,X2),unit) = ld(X2,ld(X1,unit)),
inference(spm,[status(thm)],[c_0_65,c_0_45]) ).
cnf(c_0_71,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(rd(X1,X3),mult(X3,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_66,c_0_51]),c_0_67]),c_0_68]),c_0_51]),c_0_64]),c_0_68]) ).
cnf(c_0_72,plain,
rd(ld(X1,unit),X2) = ld(X1,ld(X2,unit)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_57]),c_0_70]) ).
cnf(c_0_73,plain,
mult(X1,ld(X2,ld(X3,unit))) = rd(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_51,c_0_70]) ).
cnf(c_0_74,plain,
mult(rd(X1,mult(X2,X3)),X2) = mult(rd(X1,X2),rd(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_51]) ).
cnf(c_0_75,plain,
rd(X1,mult(ld(X2,X3),X4)) = mult(X1,ld(X4,ld(X3,X2))),
inference(spm,[status(thm)],[c_0_67,c_0_64]) ).
cnf(c_0_76,plain,
mult(rd(X1,mult(X2,X3)),X3) = mult(rd(X1,X3),ld(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_20]),c_0_75]),c_0_15]) ).
cnf(c_0_77,plain,
ld(ld(X1,unit),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_45]) ).
fof(c_0_78,negated_conjecture,
~ ( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
| ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
| ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
| ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_79,plain,
mult(mult(X1,ld(X2,X3)),X2) = mult(rd(X1,X2),mult(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_37]),c_0_67]),c_0_77]) ).
fof(c_0_80,negated_conjecture,
( mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0))) != mult(mult(mult(esk3_0,esk1_0),esk3_0),esk2_0)
& mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)
& mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0)) != mult(mult(esk9_0,mult(esk7_0,esk8_0)),esk9_0)
& mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0)) != mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])])])])]) ).
cnf(c_0_81,plain,
rd(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),rd(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_79]),c_0_67]),c_0_68]),c_0_51]),c_0_77]) ).
cnf(c_0_82,negated_conjecture,
mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_83,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_81]),c_0_23]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP667+6 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 10:41:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.33/23.39 eprover: CPU time limit exceeded, terminating
% 0.33/23.39 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.41 eprover: CPU time limit exceeded, terminating
% 0.45/46.41 eprover: CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.43 eprover: CPU time limit exceeded, terminating
% 0.58/69.43 eprover: CPU time limit exceeded, terminating
% 0.58/69.44 eprover: CPU time limit exceeded, terminating
% 0.58/69.45 eprover: CPU time limit exceeded, terminating
% 0.58/69.46 eprover: CPU time limit exceeded, terminating
% 0.59/70.77 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.59/70.77
% 0.59/70.77 # Failure: Resource limit exceeded (time)
% 0.59/70.77 # OLD status Res
% 0.59/70.77 # Preprocessing time : 0.014 s
% 0.59/70.77 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.59/70.77
% 0.59/70.77 # Failure: Resource limit exceeded (time)
% 0.59/70.77 # OLD status Res
% 0.59/70.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.59/70.77 # Preprocessing time : 0.014 s
% 0.59/70.77 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.59/70.77
% 0.59/70.77 # Failure: Resource limit exceeded (time)
% 0.59/70.77 # OLD status Res
% 0.59/70.77 # Preprocessing time : 0.008 s
% 0.59/70.77 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 0.59/70.77 # Preprocessing time : 0.007 s
% 0.59/70.77
% 0.59/70.77 # Proof found!
% 0.59/70.77 # SZS status Theorem
% 0.59/70.77 # SZS output start CNFRefutation
% See solution above
% 0.59/70.77 # Proof object total steps : 85
% 0.59/70.77 # Proof object clause steps : 64
% 0.59/70.77 # Proof object formula steps : 21
% 0.59/70.77 # Proof object conjectures : 5
% 0.59/70.77 # Proof object clause conjectures : 2
% 0.59/70.77 # Proof object formula conjectures : 3
% 0.59/70.77 # Proof object initial clauses used : 10
% 0.59/70.77 # Proof object initial formulas used : 10
% 0.59/70.77 # Proof object generating inferences : 50
% 0.59/70.77 # Proof object simplifying inferences : 49
% 0.59/70.77 # Training examples: 0 positive, 0 negative
% 0.59/70.77 # Parsed axioms : 10
% 0.59/70.77 # Removed by relevancy pruning/SinE : 0
% 0.59/70.77 # Initial clauses : 13
% 0.59/70.77 # Removed in clause preprocessing : 0
% 0.59/70.77 # Initial clauses in saturation : 13
% 0.59/70.77 # Processed clauses : 1325
% 0.59/70.77 # ...of these trivial : 748
% 0.59/70.77 # ...subsumed : 71
% 0.59/70.77 # ...remaining for further processing : 506
% 0.59/70.77 # Other redundant clauses eliminated : 0
% 0.59/70.77 # Clauses deleted for lack of memory : 0
% 0.59/70.77 # Backward-subsumed : 0
% 0.59/70.77 # Backward-rewritten : 149
% 0.59/70.77 # Generated clauses : 105152
% 0.59/70.77 # ...of the previous two non-trivial : 90813
% 0.59/70.77 # Contextual simplify-reflections : 0
% 0.59/70.77 # Paramodulations : 105152
% 0.59/70.77 # Factorizations : 0
% 0.59/70.77 # Equation resolutions : 0
% 0.59/70.77 # Current number of processed clauses : 357
% 0.59/70.77 # Positive orientable unit clauses : 353
% 0.59/70.77 # Positive unorientable unit clauses: 1
% 0.59/70.77 # Negative unit clauses : 3
% 0.59/70.77 # Non-unit-clauses : 0
% 0.59/70.77 # Current number of unprocessed clauses: 57349
% 0.59/70.77 # ...number of literals in the above : 57349
% 0.59/70.77 # Current number of archived formulas : 0
% 0.59/70.77 # Current number of archived clauses : 149
% 0.59/70.77 # Clause-clause subsumption calls (NU) : 0
% 0.59/70.77 # Rec. Clause-clause subsumption calls : 0
% 0.59/70.77 # Non-unit clause-clause subsumptions : 0
% 0.59/70.77 # Unit Clause-clause subsumption calls : 93
% 0.59/70.77 # Rewrite failures with RHS unbound : 0
% 0.59/70.77 # BW rewrite match attempts : 2968
% 0.59/70.77 # BW rewrite match successes : 142
% 0.59/70.77 # Condensation attempts : 0
% 0.59/70.77 # Condensation successes : 0
% 0.59/70.77 # Termbank termtop insertions : 2260586
% 0.59/70.77
% 0.59/70.77 # -------------------------------------------------
% 0.59/70.77 # User time : 1.062 s
% 0.59/70.77 # System time : 0.038 s
% 0.59/70.77 # Total time : 1.100 s
% 0.59/70.77 # Maximum resident set size: 86016 pages
% 0.59/92.45 eprover: CPU time limit exceeded, terminating
% 0.59/92.46 eprover: CPU time limit exceeded, terminating
% 0.59/92.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.46 eprover: No such file or directory
% 0.59/92.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.47 eprover: No such file or directory
% 0.59/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.48 eprover: No such file or directory
% 0.59/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.48 eprover: No such file or directory
% 0.59/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.48 eprover: No such file or directory
% 0.59/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.48 eprover: No such file or directory
% 0.59/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.49 eprover: No such file or directory
% 0.59/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.49 eprover: No such file or directory
% 0.59/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.49 eprover: No such file or directory
% 0.59/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.50 eprover: No such file or directory
% 0.59/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.50 eprover: No such file or directory
% 0.59/92.50 eprover: CPU time limit exceeded, terminating
% 0.59/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.50 eprover: No such file or directory
% 0.59/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.50 eprover: No such file or directory
% 0.59/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.51 eprover: No such file or directory
% 0.59/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.51 eprover: No such file or directory
% 0.59/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.51 eprover: No such file or directory
% 0.59/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.52 eprover: No such file or directory
% 0.59/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.59/92.52 eprover: No such file or directory
% 0.59/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.52 eprover: No such file or directory
% 0.59/92.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.53 eprover: No such file or directory
% 0.59/92.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.54 eprover: No such file or directory
% 0.59/92.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.54 eprover: No such file or directory
% 0.59/92.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.55 eprover: No such file or directory
% 0.59/92.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/92.55 eprover: No such file or directory
%------------------------------------------------------------------------------