TSTP Solution File: SWV407+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:16:29 EDT 2022
% Result : Theorem 0.12s 1.53s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 57 ( 11 unt; 0 def)
% Number of atoms : 168 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 170 ( 59 ~; 80 |; 19 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 150 ( 27 sgn 85 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l43_co,conjecture,
! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l43_co) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(l43_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l43_li4142) ).
fof(l43_l44,lemma,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l43_l44) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_12,plain,
! [X5,X6,X7] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ strictly_less_than(findmin_pqp_res(X5),lookup_slb(X6,findmin_pqp_res(X5)))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax48])])])]) ).
fof(c_0_13,plain,
! [X5,X6,X7] :
( X6 = create_slb
| contains_slb(X6,findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
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)],[ax47])])])])]) ).
fof(c_0_14,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(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)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_16,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l43_co]) ).
fof(c_0_21,plain,
! [X5,X6,X7] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])])]) ).
cnf(c_0_22,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,negated_conjecture,
( contains_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)
& strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_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)],[inference(fof_simplification,[status(thm)],[c_0_20])])])])])]) ).
cnf(c_0_25,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| findmin_cpq_eff(triple(X1,X2,X4)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X4)
| X2 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]) ).
fof(c_0_29,lemma,
! [X6,X7,X8,X9,X10,X6,X7,X8] :
( ( ~ check_cpq(triple(X6,X7,X8))
| ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) )
& ( pair_in_list(X7,esk5_2(X6,X7),esk6_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) )
& ( ~ less_than(esk6_2(X6,X7),esk5_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) ) ),
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)],[l43_li4142])])])])])])]) ).
cnf(c_0_30,negated_conjecture,
( findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)
| create_slb = esk2_0
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ check_cpq(triple(X4,X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( create_slb = esk2_0
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk3_0))
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
fof(c_0_33,lemma,
! [X6,X7,X8,X9] :
( ( pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,esk7_4(X6,X7,X8,X9))
| pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6))
| ~ contains_slb(X7,X9)
| ~ strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8))) )
& ( less_than(findmin_pqp_res(X6),esk7_4(X6,X7,X8,X9))
| pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6))
| ~ contains_slb(X7,X9)
| ~ strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8))) ) ),
inference(distribute,[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)],[l43_l44])])])])])]) ).
fof(c_0_34,plain,
! [X4,X5,X6] :
( ~ less_than(X4,X5)
| ~ less_than(X5,X6)
| less_than(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
cnf(c_0_35,lemma,
( create_slb = esk2_0
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]) ).
cnf(c_0_36,lemma,
( pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,findmin_pqp_res(X2))
| pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,esk7_4(X2,X3,X4,X1))
| ~ strictly_less_than(X1,findmin_cpq_res(triple(X2,X3,X4)))
| ~ contains_slb(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,lemma,
( create_slb = esk2_0
| pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1,findmin_pqp_res(esk1_0))
| less_than(esk7_4(esk1_0,esk2_0,X2,X1),X1)
| ~ contains_slb(esk2_0,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(esk1_0,esk2_0,X2))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_39,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])])]) ).
cnf(c_0_40,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_42,plain,
! [X5,X6,X7] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])])]) ).
cnf(c_0_43,lemma,
( create_slb = esk2_0
| pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1,findmin_pqp_res(esk1_0))
| less_than(X2,X1)
| ~ contains_slb(esk2_0,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(esk1_0,esk2_0,X3)))
| ~ less_than(X2,esk7_4(esk1_0,esk2_0,X3,X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,lemma,
( pair_in_list(update_slb(X3,findmin_pqp_res(X2)),X1,findmin_pqp_res(X2))
| less_than(findmin_pqp_res(X2),esk7_4(X2,X3,X4,X1))
| ~ strictly_less_than(X1,findmin_cpq_res(triple(X2,X3,X4)))
| ~ contains_slb(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
contains_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_47,negated_conjecture,
~ less_than(findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_49,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax20])]) ).
cnf(c_0_50,lemma,
( create_slb = esk2_0
| less_than(findmin_pqp_res(esk1_0),X1)
| ~ contains_slb(esk2_0,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(esk1_0,esk2_0,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_51,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( create_slb = esk2_0
| ~ less_than(findmin_pqp_res(esk1_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,negated_conjecture,
create_slb = esk2_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_41]),c_0_51])]),c_0_52]) ).
cnf(c_0_55,plain,
~ contains_slb(esk2_0,X1),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_51,c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.17 % Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.19 % Command : run_ET %s %d
% 0.07/0.43 % Computer : n006.cluster.edu
% 0.07/0.43 % Model : x86_64 x86_64
% 0.07/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.43 % Memory : 8042.1875MB
% 0.07/0.43 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.43 % CPULimit : 300
% 0.07/0.43 % WCLimit : 600
% 0.07/0.43 % DateTime : Wed Jun 15 06:23:41 EDT 2022
% 0.07/0.43 % CPUTime :
% 0.12/1.53 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.12/1.53 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.12/1.53 # Preprocessing time : 0.011 s
% 0.12/1.53
% 0.12/1.53 # Proof found!
% 0.12/1.53 # SZS status Theorem
% 0.12/1.53 # SZS output start CNFRefutation
% See solution above
% 0.12/1.53 # Proof object total steps : 57
% 0.12/1.53 # Proof object clause steps : 32
% 0.12/1.53 # Proof object formula steps : 25
% 0.12/1.53 # Proof object conjectures : 13
% 0.12/1.53 # Proof object clause conjectures : 10
% 0.12/1.53 # Proof object formula conjectures : 3
% 0.12/1.53 # Proof object initial clauses used : 16
% 0.12/1.53 # Proof object initial formulas used : 12
% 0.12/1.53 # Proof object generating inferences : 12
% 0.12/1.53 # Proof object simplifying inferences : 10
% 0.12/1.53 # Training examples: 0 positive, 0 negative
% 0.12/1.53 # Parsed axioms : 44
% 0.12/1.53 # Removed by relevancy pruning/SinE : 15
% 0.12/1.53 # Initial clauses : 43
% 0.12/1.53 # Removed in clause preprocessing : 0
% 0.12/1.53 # Initial clauses in saturation : 43
% 0.12/1.53 # Processed clauses : 1283
% 0.12/1.53 # ...of these trivial : 0
% 0.12/1.53 # ...subsumed : 920
% 0.12/1.53 # ...remaining for further processing : 363
% 0.12/1.53 # Other redundant clauses eliminated : 3
% 0.12/1.53 # Clauses deleted for lack of memory : 0
% 0.12/1.53 # Backward-subsumed : 34
% 0.12/1.53 # Backward-rewritten : 191
% 0.12/1.53 # Generated clauses : 14230
% 0.12/1.53 # ...of the previous two non-trivial : 13138
% 0.12/1.53 # Contextual simplify-reflections : 983
% 0.12/1.53 # Paramodulations : 13943
% 0.12/1.53 # Factorizations : 284
% 0.12/1.53 # Equation resolutions : 3
% 0.12/1.53 # Current number of processed clauses : 135
% 0.12/1.53 # Positive orientable unit clauses : 13
% 0.12/1.53 # Positive unorientable unit clauses: 0
% 0.12/1.53 # Negative unit clauses : 2
% 0.12/1.53 # Non-unit-clauses : 120
% 0.12/1.53 # Current number of unprocessed clauses: 2685
% 0.12/1.53 # ...number of literals in the above : 17253
% 0.12/1.53 # Current number of archived formulas : 0
% 0.12/1.53 # Current number of archived clauses : 226
% 0.12/1.53 # Clause-clause subsumption calls (NU) : 69659
% 0.12/1.53 # Rec. Clause-clause subsumption calls : 34273
% 0.12/1.53 # Non-unit clause-clause subsumptions : 1932
% 0.12/1.53 # Unit Clause-clause subsumption calls : 56
% 0.12/1.53 # Rewrite failures with RHS unbound : 0
% 0.12/1.53 # BW rewrite match attempts : 8
% 0.12/1.53 # BW rewrite match successes : 3
% 0.12/1.53 # Condensation attempts : 0
% 0.12/1.53 # Condensation successes : 0
% 0.12/1.53 # Termbank termtop insertions : 336635
% 0.12/1.53
% 0.12/1.53 # -------------------------------------------------
% 0.12/1.53 # User time : 0.408 s
% 0.12/1.53 # System time : 0.006 s
% 0.12/1.53 # Total time : 0.414 s
% 0.12/1.53 # Maximum resident set size: 13376 pages
% 0.12/27.75 eprover: CPU time limit exceeded, terminating
% 0.12/27.76 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.76 eprover: No such file or directory
% 0.12/27.77 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.77 eprover: No such file or directory
% 0.12/27.77 eprover: CPU time limit exceeded, terminating
% 0.12/27.77 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.77 eprover: No such file or directory
% 0.12/27.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.78 eprover: No such file or directory
% 0.12/27.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.78 eprover: No such file or directory
% 0.12/27.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.78 eprover: No such file or directory
% 0.12/27.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.78 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.79 eprover: No such file or directory
% 0.12/27.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.80 eprover: No such file or directory
% 0.12/27.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.80 eprover: No such file or directory
% 0.12/27.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.80 eprover: No such file or directory
% 0.12/27.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.80 eprover: No such file or directory
% 0.12/27.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.80 eprover: No such file or directory
% 0.12/27.81 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.81 eprover: No such file or directory
% 0.12/27.81 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.81 eprover: No such file or directory
% 0.12/27.81 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.81 eprover: No such file or directory
% 0.12/27.82 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.12/27.82 eprover: No such file or directory
% 0.12/28.00 eprover: CPU time limit exceeded, terminating
% 0.12/28.01 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.01 eprover: No such file or directory
% 0.12/28.02 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.02 eprover: No such file or directory
% 0.12/28.02 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.02 eprover: No such file or directory
% 0.12/28.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.03 eprover: No such file or directory
% 0.12/28.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.03 eprover: No such file or directory
% 0.12/28.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.03 eprover: No such file or directory
% 0.12/28.04 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.04 eprover: No such file or directory
% 0.12/28.04 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.04 eprover: No such file or directory
% 0.12/28.05 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.05 eprover: No such file or directory
% 0.12/28.05 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.05 eprover: No such file or directory
% 0.12/28.06 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.12/28.06 eprover: No such file or directory
%------------------------------------------------------------------------------