TSTP Solution File: SWW958+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW958+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : Thu Jul 21 00:11:45 EDT 2022
% Result : Theorem 0.20s 1.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 88 ( 34 unt; 0 def)
% Number of atoms : 175 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 159 ( 72 ~; 67 |; 7 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 5 con; 0-2 aty)
% Number of variables : 122 ( 13 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax272,axiom,
! [X100,X101,X102] :
( ( pred_attacker(tuple_client_A_in_4(X101,X100))
& pred_attacker(tuple_client_A_in_2(X101))
& pred_attacker(tuple_client_A_in_1(X102)) )
=> pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X100,name_skA),constr_neg(name_Na)))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax272) ).
fof(ax242,axiom,
! [X76,X77] :
( ( pred_attacker(X76)
& pred_attacker(X77) )
=> pred_attacker(tuple_client_A_in_4(X76,X77)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax242) ).
fof(ax246,axiom,
! [X83] :
( pred_attacker(tuple_client_A_in_2(X83))
=> pred_attacker(X83) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax246) ).
fof(ax271,axiom,
! [X98,X99] :
( ( pred_attacker(tuple_client_A_in_2(X98))
& pred_attacker(tuple_client_A_in_1(X99)) )
=> pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X99))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax271) ).
fof(ax245,axiom,
! [X82] :
( pred_attacker(X82)
=> pred_attacker(tuple_client_A_in_2(X82)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax245) ).
fof(ax266,axiom,
! [X97] : pred_attacker(name_new0x2Dname(X97)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax266) ).
fof(ax247,axiom,
! [X84] :
( pred_attacker(X84)
=> pred_attacker(tuple_client_A_in_1(X84)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax247) ).
fof(ax192,axiom,
! [X4] : constr_add(X4,constr_ZERO) = X4,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax192) ).
fof(ax193,axiom,
! [X5,X6] : constr_add(X5,X6) = constr_add(X6,X5),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax193) ).
fof(ax250,axiom,
! [X88,X89] :
( ( pred_attacker(X88)
& pred_attacker(X89) )
=> pred_attacker(constr_adec(X88,X89)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax250) ).
fof(ax190,axiom,
! [X1,X2] : constr_adec(constr_aenc(X2,constr_pkey(X1)),X1) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax190) ).
fof(ax241,axiom,
! [X74,X75] :
( pred_attacker(tuple_client_A_out_3(X74,X75))
=> pred_attacker(X75) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax241) ).
fof(ax194,axiom,
! [X7,X8,X9] : constr_add(X7,constr_add(X8,X9)) = constr_add(constr_add(X7,X8),X9),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax194) ).
fof(ax191,axiom,
! [X3] : constr_add(X3,constr_neg(X3)) = constr_ZERO,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax191) ).
fof(ax251,axiom,
! [X90,X91] :
( ( pred_attacker(X90)
& pred_attacker(X91) )
=> pred_attacker(constr_add(X90,X91)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax251) ).
fof(ax196,axiom,
! [X10] :
( pred_attacker(X10)
=> pred_attacker(constr_pkey(X10)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax196) ).
fof(co0,conjecture,
pred_attacker(name_Sa),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax238,axiom,
! [X69] :
( pred_attacker(tuple_client_A_out_5(X69))
=> pred_attacker(X69) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax238) ).
fof(ax204,axiom,
! [X18] :
( pred_attacker(tuple_out_1(X18))
=> pred_attacker(X18) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax204) ).
fof(ax249,axiom,
! [X86,X87] :
( ( pred_attacker(X86)
& pred_attacker(X87) )
=> pred_attacker(constr_aenc(X86,X87)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax249) ).
fof(ax267,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax267) ).
fof(ax252,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax252) ).
fof(c_0_22,plain,
! [X103,X104,X105] :
( ~ pred_attacker(tuple_client_A_in_4(X104,X103))
| ~ pred_attacker(tuple_client_A_in_2(X104))
| ~ pred_attacker(tuple_client_A_in_1(X105))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X103,name_skA),constr_neg(name_Na)))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax272])])])]) ).
fof(c_0_23,plain,
! [X78,X79] :
( ~ pred_attacker(X78)
| ~ pred_attacker(X79)
| pred_attacker(tuple_client_A_in_4(X78,X79)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax242])]) ).
fof(c_0_24,plain,
! [X84] :
( ~ pred_attacker(tuple_client_A_in_2(X84))
| pred_attacker(X84) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax246])]) ).
fof(c_0_25,plain,
! [X100,X101] :
( ~ pred_attacker(tuple_client_A_in_2(X100))
| ~ pred_attacker(tuple_client_A_in_1(X101))
| pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X101))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax271])]) ).
fof(c_0_26,plain,
! [X83] :
( ~ pred_attacker(X83)
| pred_attacker(tuple_client_A_in_2(X83)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax245])]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_1(X2))
| ~ pred_attacker(tuple_client_A_in_2(X3))
| ~ pred_attacker(tuple_client_A_in_4(X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( pred_attacker(tuple_client_A_in_4(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_1(X1))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X98] : pred_attacker(name_new0x2Dname(X98)),
inference(variable_rename,[status(thm)],[ax266]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_attacker(tuple_client_A_in_1(X3))
| ~ pred_attacker(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
fof(c_0_34,plain,
! [X85] :
( ~ pred_attacker(X85)
| pred_attacker(tuple_client_A_in_1(X85)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax247])]) ).
fof(c_0_35,plain,
! [X5] : constr_add(X5,constr_ZERO) = X5,
inference(variable_rename,[status(thm)],[ax192]) ).
fof(c_0_36,plain,
! [X7,X8] : constr_add(X7,X8) = constr_add(X8,X7),
inference(variable_rename,[status(thm)],[ax193]) ).
fof(c_0_37,plain,
! [X90,X91] :
( ~ pred_attacker(X90)
| ~ pred_attacker(X91)
| pred_attacker(constr_adec(X90,X91)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax250])]) ).
fof(c_0_38,plain,
! [X3,X4] : constr_adec(constr_aenc(X4,constr_pkey(X3)),X3) = X4,
inference(variable_rename,[status(thm)],[ax190]) ).
fof(c_0_39,plain,
! [X76,X77] :
( ~ pred_attacker(tuple_client_A_out_3(X76,X77))
| pred_attacker(X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax241])]) ).
cnf(c_0_40,plain,
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_1(X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_1(X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_43,plain,
( pred_attacker(tuple_client_A_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_44,plain,
! [X10,X11,X12] : constr_add(X10,constr_add(X11,X12)) = constr_add(constr_add(X10,X11),X12),
inference(variable_rename,[status(thm)],[ax194]) ).
fof(c_0_45,plain,
! [X4] : constr_add(X4,constr_neg(X4)) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax191]) ).
cnf(c_0_46,plain,
constr_add(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,plain,
constr_add(X1,X2) = constr_add(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( pred_attacker(constr_adec(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,plain,
constr_adec(constr_aenc(X1,constr_pkey(X2)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_50,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_3(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,plain,
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_52,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
fof(c_0_53,plain,
! [X92,X93] :
( ~ pred_attacker(X92)
| ~ pred_attacker(X93)
| pred_attacker(constr_add(X92,X93)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax251])]) ).
cnf(c_0_54,plain,
constr_add(X1,constr_add(X2,X3)) = constr_add(constr_add(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,plain,
constr_add(X1,constr_neg(X1)) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
constr_add(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_aenc(X1,constr_pkey(X2)))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
( pred_attacker(constr_aenc(constr_add(name_Na,name_Sa),X1))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_59,plain,
! [X11] :
( ~ pred_attacker(X11)
| pred_attacker(constr_pkey(X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax196])]) ).
cnf(c_0_60,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_61,plain,
( pred_attacker(constr_add(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
constr_add(X1,constr_add(constr_neg(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,plain,
( pred_attacker(constr_add(name_Na,name_Sa))
| ~ pred_attacker(tuple_client_A_in_1(constr_pkey(X1)))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( pred_attacker(constr_pkey(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
fof(c_0_65,negated_conjecture,
~ pred_attacker(name_Sa),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_66,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_41]) ).
cnf(c_0_67,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_add(constr_neg(X2),X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
constr_neg(constr_neg(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_55]),c_0_46]) ).
cnf(c_0_69,plain,
( pred_attacker(constr_add(name_Na,name_Sa))
| ~ pred_attacker(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_43]),c_0_64]) ).
fof(c_0_70,negated_conjecture,
~ pred_attacker(name_Sa),
inference(fof_simplification,[status(thm)],[c_0_65]) ).
fof(c_0_71,plain,
! [X70] :
( ~ pred_attacker(tuple_client_A_out_5(X70))
| pred_attacker(X70) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax238])]) ).
cnf(c_0_72,plain,
( pred_attacker(tuple_client_A_out_5(constr_add(X1,constr_neg(name_Na))))
| ~ pred_attacker(constr_aenc(X1,constr_pkey(name_skA))) ),
inference(spm,[status(thm)],[c_0_66,c_0_49]) ).
cnf(c_0_73,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_add(X2,X1))
| ~ pred_attacker(constr_neg(X2)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,plain,
pred_attacker(constr_add(name_Na,name_Sa)),
inference(spm,[status(thm)],[c_0_69,c_0_41]) ).
cnf(c_0_75,negated_conjecture,
~ pred_attacker(name_Sa),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
fof(c_0_76,plain,
! [X19] :
( ~ pred_attacker(tuple_out_1(X19))
| pred_attacker(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax204])]) ).
cnf(c_0_77,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_5(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_78,plain,
( pred_attacker(tuple_client_A_out_5(constr_neg(name_Na)))
| ~ pred_attacker(constr_aenc(constr_ZERO,constr_pkey(name_skA))) ),
inference(spm,[status(thm)],[c_0_72,c_0_56]) ).
cnf(c_0_79,plain,
~ pred_attacker(constr_neg(name_Na)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
fof(c_0_80,plain,
! [X88,X89] :
( ~ pred_attacker(X88)
| ~ pred_attacker(X89)
| pred_attacker(constr_aenc(X88,X89)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax249])]) ).
cnf(c_0_81,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_82,plain,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
inference(split_conjunct,[status(thm)],[ax267]) ).
cnf(c_0_83,plain,
~ pred_attacker(constr_aenc(constr_ZERO,constr_pkey(name_skA))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_84,plain,
( pred_attacker(constr_aenc(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_85,plain,
pred_attacker(constr_pkey(name_skA)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,plain,
pred_attacker(constr_ZERO),
inference(split_conjunct,[status(thm)],[ax252]) ).
cnf(c_0_87,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWW958+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 5 21:22:02 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.40 # Preprocessing time : 0.010 s
% 0.20/1.40
% 0.20/1.40 # Failure: Out of unprocessed clauses!
% 0.20/1.40 # OLD status GaveUp
% 0.20/1.40 # Parsed axioms : 277
% 0.20/1.40 # Removed by relevancy pruning/SinE : 176
% 0.20/1.40 # Initial clauses : 101
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 101
% 0.20/1.40 # Processed clauses : 101
% 0.20/1.40 # ...of these trivial : 0
% 0.20/1.40 # ...subsumed : 0
% 0.20/1.40 # ...remaining for further processing : 101
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 0
% 0.20/1.40 # Backward-rewritten : 0
% 0.20/1.40 # Generated clauses : 0
% 0.20/1.40 # ...of the previous two non-trivial : 0
% 0.20/1.40 # Contextual simplify-reflections : 0
% 0.20/1.40 # Paramodulations : 0
% 0.20/1.40 # Factorizations : 0
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 101
% 0.20/1.40 # Positive orientable unit clauses : 4
% 0.20/1.40 # Positive unorientable unit clauses: 0
% 0.20/1.40 # Negative unit clauses : 97
% 0.20/1.40 # Non-unit-clauses : 0
% 0.20/1.40 # Current number of unprocessed clauses: 0
% 0.20/1.40 # ...number of literals in the above : 0
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 0
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.20/1.40 # Non-unit clause-clause subsumptions : 0
% 0.20/1.40 # Unit Clause-clause subsumption calls : 203
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 0
% 0.20/1.40 # BW rewrite match successes : 0
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 1972
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.007 s
% 0.20/1.40 # System time : 0.004 s
% 0.20/1.40 # Total time : 0.011 s
% 0.20/1.40 # Maximum resident set size: 2996 pages
% 0.20/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.20/1.40 # Preprocessing time : 0.020 s
% 0.20/1.40
% 0.20/1.40 # Proof found!
% 0.20/1.40 # SZS status Theorem
% 0.20/1.40 # SZS output start CNFRefutation
% See solution above
% 0.20/1.40 # Proof object total steps : 88
% 0.20/1.40 # Proof object clause steps : 45
% 0.20/1.40 # Proof object formula steps : 43
% 0.20/1.40 # Proof object conjectures : 4
% 0.20/1.40 # Proof object clause conjectures : 1
% 0.20/1.40 # Proof object formula conjectures : 3
% 0.20/1.40 # Proof object initial clauses used : 22
% 0.20/1.40 # Proof object initial formulas used : 22
% 0.20/1.40 # Proof object generating inferences : 23
% 0.20/1.40 # Proof object simplifying inferences : 9
% 0.20/1.40 # Training examples: 0 positive, 0 negative
% 0.20/1.40 # Parsed axioms : 277
% 0.20/1.40 # Removed by relevancy pruning/SinE : 0
% 0.20/1.40 # Initial clauses : 277
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 277
% 0.20/1.40 # Processed clauses : 316
% 0.20/1.40 # ...of these trivial : 3
% 0.20/1.40 # ...subsumed : 3
% 0.20/1.40 # ...remaining for further processing : 310
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 7
% 0.20/1.40 # Backward-rewritten : 1
% 0.20/1.40 # Generated clauses : 322
% 0.20/1.40 # ...of the previous two non-trivial : 263
% 0.20/1.40 # Contextual simplify-reflections : 5
% 0.20/1.40 # Paramodulations : 322
% 0.20/1.40 # Factorizations : 0
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 302
% 0.20/1.40 # Positive orientable unit clauses : 32
% 0.20/1.40 # Positive unorientable unit clauses: 1
% 0.20/1.40 # Negative unit clauses : 194
% 0.20/1.40 # Non-unit-clauses : 75
% 0.20/1.40 # Current number of unprocessed clauses: 28
% 0.20/1.40 # ...number of literals in the above : 60
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 8
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 4583
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 3947
% 0.20/1.40 # Non-unit clause-clause subsumptions : 15
% 0.20/1.40 # Unit Clause-clause subsumption calls : 4581
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 11
% 0.20/1.40 # BW rewrite match successes : 11
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 10449
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.032 s
% 0.20/1.40 # System time : 0.001 s
% 0.20/1.40 # Total time : 0.033 s
% 0.20/1.40 # Maximum resident set size: 3856 pages
% 0.20/23.39 eprover: CPU time limit exceeded, terminating
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: CPU time limit exceeded, terminating
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
% 0.20/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.48 eprover: No such file or directory
% 0.20/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.48 eprover: No such file or directory
% 0.20/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.49 eprover: No such file or directory
% 0.20/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------