TSTP Solution File: GRP667+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP667+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:12 EDT 2022
% Result : Theorem 0.62s 72.80s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 12
% Syntax : Number of formulae : 100 ( 92 unt; 0 def)
% Number of atoms : 108 ( 107 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 6 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 203 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X10,X11,X12] :
( mult(mult(X10,X11),mult(X12,X10)) = mult(X10,mult(mult(X11,X12),X10))
=> mult(X10,mult(X11,mult(X10,X12))) = mult(mult(mult(X10,X11),X10),X12) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f12) ).
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(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f06) ).
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(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(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f01) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f02) ).
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,
mult(a,mult(b,mult(a,c))) = mult(mult(mult(a,b),a),c),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(f10,axiom,
! [X4,X5,X6] :
( mult(X4,mult(X5,mult(X6,X5))) = mult(mult(mult(X4,X5),X6),X5)
=> mult(X5,mult(X4,mult(X5,X6))) = mult(mult(mult(X5,X4),X5),X6) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',f10) ).
fof(c_0_12,plain,
! [X13,X14,X15] :
( mult(mult(X13,X14),mult(X15,X13)) != mult(X13,mult(mult(X14,X15),X13))
| mult(X13,mult(X14,mult(X13,X15))) = mult(mult(mult(X13,X14),X13),X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[f12])]) ).
fof(c_0_13,plain,
! [X3,X4] : mult(mult(X4,X3),X4) = mult(X4,mult(X3,X4)),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_14,plain,
( mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3)
| mult(mult(X1,X2),mult(X3,X1)) != mult(X1,mult(mult(X2,X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X3] : mult(unit,X3) = X3,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_17,plain,
! [X3] : mult(X3,unit) = X3,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_18,plain,
! [X3,X4] : rd(mult(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_19,plain,
( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(X1,X2),mult(X3,X1)) != mult(X1,mult(mult(X2,X3),X1)) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,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]) ).
cnf(c_0_23,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_21]),c_0_20])]) ).
fof(c_0_25,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_26,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_27,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_22]) ).
cnf(c_0_28,plain,
rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,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_27,c_0_15]),c_0_15]) ).
cnf(c_0_32,plain,
rd(mult(X1,X2),ld(X1,X2)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X1))) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_34,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_31]) ).
fof(c_0_35,plain,
! [X3,X4] : mult(rd(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_36,plain,
mult(mult(X1,X2),mult(X1,X2)) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,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_31,c_0_20]),c_0_20]) ).
cnf(c_0_39,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_40,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_41,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
mult(mult(X1,X2),ld(X2,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29]),c_0_40]) ).
cnf(c_0_43,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_44,plain,
rd(mult(X1,X1),mult(X2,X1)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_45,plain,
mult(mult(X1,rd(X1,X2)),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
rd(mult(X1,X1),X2) = rd(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_47,plain,
ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_48,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_49,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_50,plain,
rd(X1,rd(X2,X1)) = mult(X1,rd(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
mult(ld(X1,unit),X1) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_20]),c_0_48]) ).
cnf(c_0_52,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_53,plain,
mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_23]) ).
cnf(c_0_54,plain,
mult(X1,mult(X1,ld(mult(X1,X1),X2))) = X2,
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_55,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_34,c_0_51]),c_0_20]),c_0_52]),c_0_23]) ).
cnf(c_0_56,plain,
rd(X1,mult(X2,X1)) = ld(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_53]) ).
cnf(c_0_57,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(spm,[status(thm)],[c_0_30,c_0_40]) ).
cnf(c_0_58,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_54]) ).
fof(c_0_59,plain,
! [X3] : mult(f(X3),f(X3)) = X3,
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_60,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_55]),c_0_56]),c_0_23]) ).
cnf(c_0_61,plain,
mult(ld(mult(X1,X2),X1),X1) = ld(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_42]),c_0_57]) ).
cnf(c_0_62,plain,
ld(mult(X1,X1),X2) = ld(X1,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_58]) ).
cnf(c_0_63,plain,
mult(f(X1),f(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,plain,
mult(mult(X1,X2),ld(X2,unit)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_60]) ).
cnf(c_0_65,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_66,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(rw,[status(thm)],[c_0_61,c_0_60]) ).
cnf(c_0_67,plain,
ld(ld(X1,X2),unit) = ld(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_42]),c_0_62]),c_0_30]) ).
cnf(c_0_68,plain,
ld(X1,rd(X1,X2)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_60,c_0_37]) ).
cnf(c_0_69,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_31,c_0_39]),c_0_29]) ).
cnf(c_0_70,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_71,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_64,c_0_37]) ).
cnf(c_0_72,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_57,c_0_63]) ).
cnf(c_0_73,plain,
rd(X1,ld(X2,unit)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_65,c_0_60]) ).
cnf(c_0_74,plain,
ld(ld(X1,X2),X3) = mult(ld(X2,X1),X3),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_75,plain,
rd(ld(X1,X2),X2) = ld(mult(X2,X1),X2),
inference(spm,[status(thm)],[c_0_23,c_0_61]) ).
cnf(c_0_76,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(rw,[status(thm)],[c_0_56,c_0_68]) ).
cnf(c_0_77,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_69,c_0_70]),c_0_60]),c_0_71]),c_0_60]),c_0_66]),c_0_69]),c_0_72]) ).
cnf(c_0_78,plain,
rd(X1,ld(X2,X3)) = mult(X1,ld(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_21]) ).
cnf(c_0_79,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_80,plain,
rd(ld(X1,X2),X2) = ld(X1,unit),
inference(rw,[status(thm)],[c_0_75,c_0_60]) ).
cnf(c_0_81,plain,
ld(mult(X1,X2),unit) = ld(X2,ld(X1,unit)),
inference(spm,[status(thm)],[c_0_68,c_0_76]) ).
cnf(c_0_82,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_77,c_0_71]),c_0_78]),c_0_79]),c_0_71]),c_0_74]),c_0_79]) ).
cnf(c_0_83,plain,
rd(ld(X1,unit),X2) = ld(X1,ld(X2,unit)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_60]),c_0_81]) ).
cnf(c_0_84,plain,
mult(X1,ld(X2,ld(X3,unit))) = rd(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_71,c_0_81]) ).
cnf(c_0_85,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_82,c_0_83]),c_0_84]),c_0_71]) ).
cnf(c_0_86,plain,
rd(X1,mult(ld(X2,X3),X4)) = mult(X1,ld(X4,ld(X3,X2))),
inference(spm,[status(thm)],[c_0_78,c_0_74]) ).
cnf(c_0_87,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_85,c_0_39]),c_0_86]),c_0_29]) ).
fof(c_0_88,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_89,plain,
! [X7,X8,X9] :
( mult(X7,mult(X8,mult(X9,X8))) != mult(mult(mult(X7,X8),X9),X8)
| mult(X8,mult(X7,mult(X8,X9))) = mult(mult(mult(X8,X7),X8),X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[f10])]) ).
cnf(c_0_90,plain,
mult(mult(X1,ld(X2,X3)),X2) = mult(rd(X1,X2),mult(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_66]),c_0_78]),c_0_74]),c_0_79]) ).
fof(c_0_91,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(fof_simplification,[status(thm)],[c_0_88]) ).
cnf(c_0_92,plain,
( mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3)
| mult(X2,mult(X1,mult(X3,X1))) != mult(mult(mult(X2,X1),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_93,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_90]),c_0_78]),c_0_79]),c_0_71]),c_0_74]),c_0_79]) ).
cnf(c_0_94,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_95,plain,
( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(mult(X2,X1),X3),X1) != mult(X2,mult(X1,mult(X3,X1))) ),
inference(rw,[status(thm)],[c_0_92,c_0_15]) ).
cnf(c_0_96,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_34,c_0_93]),c_0_23]) ).
cnf(c_0_97,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_94,c_0_15]) ).
cnf(c_0_98,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP667+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n011.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 : Mon Jun 13 13:57:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.34/23.39 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.46/46.41 eprover: CPU time limit exceeded, terminating
% 0.46/46.41 eprover: CPU time limit exceeded, terminating
% 0.46/46.42 eprover: CPU time limit exceeded, terminating
% 0.46/46.42 eprover: CPU time limit exceeded, terminating
% 0.60/69.43 eprover: CPU time limit exceeded, terminating
% 0.60/69.43 eprover: CPU time limit exceeded, terminating
% 0.60/69.43 eprover: CPU time limit exceeded, terminating
% 0.60/69.45 eprover: CPU time limit exceeded, terminating
% 0.62/72.80 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.62/72.80
% 0.62/72.80 # Failure: Resource limit exceeded (time)
% 0.62/72.80 # OLD status Res
% 0.62/72.80 # Preprocessing time : 0.014 s
% 0.62/72.80 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.62/72.80
% 0.62/72.80 # Failure: Resource limit exceeded (time)
% 0.62/72.80 # OLD status Res
% 0.62/72.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.62/72.80 # Preprocessing time : 0.007 s
% 0.62/72.80 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.62/72.80
% 0.62/72.80 # Failure: Resource limit exceeded (time)
% 0.62/72.80 # OLD status Res
% 0.62/72.80 # Preprocessing time : 0.013 s
% 0.62/72.80 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 0.62/72.80 # Preprocessing time : 0.015 s
% 0.62/72.80
% 0.62/72.80 # Proof found!
% 0.62/72.80 # SZS status Theorem
% 0.62/72.80 # SZS output start CNFRefutation
% See solution above
% 0.62/72.80 # Proof object total steps : 100
% 0.62/72.80 # Proof object clause steps : 75
% 0.62/72.80 # Proof object formula steps : 25
% 0.62/72.80 # Proof object conjectures : 6
% 0.62/72.80 # Proof object clause conjectures : 3
% 0.62/72.80 # Proof object formula conjectures : 3
% 0.62/72.80 # Proof object initial clauses used : 12
% 0.62/72.80 # Proof object initial formulas used : 12
% 0.62/72.80 # Proof object generating inferences : 53
% 0.62/72.80 # Proof object simplifying inferences : 58
% 0.62/72.80 # Training examples: 0 positive, 0 negative
% 0.62/72.80 # Parsed axioms : 13
% 0.62/72.80 # Removed by relevancy pruning/SinE : 0
% 0.62/72.80 # Initial clauses : 13
% 0.62/72.80 # Removed in clause preprocessing : 0
% 0.62/72.80 # Initial clauses in saturation : 13
% 0.62/72.80 # Processed clauses : 1594
% 0.62/72.80 # ...of these trivial : 868
% 0.62/72.80 # ...subsumed : 123
% 0.62/72.80 # ...remaining for further processing : 603
% 0.62/72.80 # Other redundant clauses eliminated : 0
% 0.62/72.80 # Clauses deleted for lack of memory : 50474
% 0.62/72.80 # Backward-subsumed : 1
% 0.62/72.80 # Backward-rewritten : 181
% 0.62/72.80 # Generated clauses : 162937
% 0.62/72.80 # ...of the previous two non-trivial : 144176
% 0.62/72.80 # Contextual simplify-reflections : 0
% 0.62/72.80 # Paramodulations : 162937
% 0.62/72.80 # Factorizations : 0
% 0.62/72.80 # Equation resolutions : 0
% 0.62/72.80 # Current number of processed clauses : 421
% 0.62/72.80 # Positive orientable unit clauses : 399
% 0.62/72.80 # Positive unorientable unit clauses: 2
% 0.62/72.80 # Negative unit clauses : 1
% 0.62/72.80 # Non-unit-clauses : 19
% 0.62/72.80 # Current number of unprocessed clauses: 49198
% 0.62/72.80 # ...number of literals in the above : 54234
% 0.62/72.80 # Current number of archived formulas : 0
% 0.62/72.80 # Current number of archived clauses : 182
% 0.62/72.80 # Clause-clause subsumption calls (NU) : 605
% 0.62/72.80 # Rec. Clause-clause subsumption calls : 604
% 0.62/72.80 # Non-unit clause-clause subsumptions : 35
% 0.62/72.80 # Unit Clause-clause subsumption calls : 694
% 0.62/72.80 # Rewrite failures with RHS unbound : 0
% 0.62/72.80 # BW rewrite match attempts : 4410
% 0.62/72.80 # BW rewrite match successes : 178
% 0.62/72.80 # Condensation attempts : 0
% 0.62/72.80 # Condensation successes : 0
% 0.62/72.80 # Termbank termtop insertions : 4509049
% 0.62/72.80
% 0.62/72.80 # -------------------------------------------------
% 0.62/72.80 # User time : 2.640 s
% 0.62/72.80 # System time : 0.080 s
% 0.62/72.80 # Total time : 2.720 s
% 0.62/72.80 # Maximum resident set size: 136328 pages
% 0.62/92.44 eprover: CPU time limit exceeded, terminating
% 0.62/92.45 eprover: CPU time limit exceeded, terminating
% 0.62/92.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.46 eprover: No such file or directory
% 0.62/92.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.46 eprover: No such file or directory
% 0.62/92.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.47 eprover: No such file or directory
% 0.62/92.47 eprover: CPU time limit exceeded, terminating
% 0.62/92.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.47 eprover: No such file or directory
% 0.62/92.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.47 eprover: No such file or directory
% 0.62/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.48 eprover: No such file or directory
% 0.62/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.48 eprover: No such file or directory
% 0.62/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.48 eprover: No such file or directory
% 0.62/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.48 eprover: No such file or directory
% 0.62/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.48 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.49 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.52 eprover: No such file or directory
%------------------------------------------------------------------------------