TSTP Solution File: ALG223+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG223+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 14 16:50:32 EDT 2022
% Result : Theorem 0.72s 93.90s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 136 ( 0 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 171 ( 73 ~; 69 |; 14 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-5 aty)
% Number of variables : 67 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_closure3,conjecture,
! [X1,X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ( ( r1_closure3(X1,X2,X4,X3)
& r1_closure3(X1,X2,X5,X4) )
=> r1_closure3(X1,X2,X5,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t4_closure3) ).
fof(d1_closure3,axiom,
! [X1,X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ( r1_closure3(X1,X2,X3,X4)
<=> ! [X5] :
~ ( r2_hidden(X5,X4)
& ! [X6] :
~ ( r2_hidden(X6,X3)
& r1_tarski(X5,X6) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d1_closure3) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X2,X3) )
=> r1_tarski(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_xboole_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k1_closure2(X1,X2)))
=> ( ( r1_closure3(X1,X2,X4,X3)
& r1_closure3(X1,X2,X5,X4) )
=> r1_closure3(X1,X2,X5,X3) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t4_closure3]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X11,X14] :
( ( r2_hidden(esk6_5(X7,X8,X9,X10,X11),X9)
| ~ r2_hidden(X11,X10)
| ~ r1_closure3(X7,X8,X9,X10)
| ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_pboole(X8,X7) )
& ( r1_tarski(X11,esk6_5(X7,X8,X9,X10,X11))
| ~ r2_hidden(X11,X10)
| ~ r1_closure3(X7,X8,X9,X10)
| ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_pboole(X8,X7) )
& ( r2_hidden(esk7_4(X7,X8,X9,X10),X10)
| r1_closure3(X7,X8,X9,X10)
| ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_pboole(X8,X7) )
& ( ~ r2_hidden(X14,X9)
| ~ r1_tarski(esk7_4(X7,X8,X9,X10),X14)
| r1_closure3(X7,X8,X9,X10)
| ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
| ~ m1_pboole(X8,X7) ) ),
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)],[d1_closure3])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( m1_pboole(esk2_0,esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
& m1_subset_1(esk4_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
& m1_subset_1(esk5_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
& r1_closure3(esk1_0,esk2_0,esk4_0,esk3_0)
& r1_closure3(esk1_0,esk2_0,esk5_0,esk4_0)
& ~ r1_closure3(esk1_0,esk2_0,esk5_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)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( r1_closure3(X2,X1,X3,X4)
| r2_hidden(esk7_4(X2,X1,X3,X4),X4)
| ~ m1_pboole(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
m1_pboole(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( r2_hidden(esk6_5(X2,X1,X3,X4,X5),X3)
| ~ m1_pboole(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ r1_closure3(X2,X1,X3,X4)
| ~ r2_hidden(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( r2_hidden(esk7_4(esk1_0,esk2_0,X1,esk3_0),esk3_0)
| r1_closure3(esk1_0,esk2_0,X1,esk3_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
~ r1_closure3(esk1_0,esk2_0,esk5_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk3_0,X2),X1)
| ~ r2_hidden(X2,esk3_0)
| ~ r1_closure3(esk1_0,esk2_0,X1,esk3_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).
cnf(c_0_14,negated_conjecture,
r2_hidden(esk7_4(esk1_0,esk2_0,esk5_0,esk3_0),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
( r1_tarski(X5,esk6_5(X2,X1,X3,X4,X5))
| ~ m1_pboole(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ r1_closure3(X2,X1,X3,X4)
| ~ r2_hidden(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)),X1)
| ~ r1_closure3(esk1_0,esk2_0,X1,esk3_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
r1_closure3(esk1_0,esk2_0,esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( r1_tarski(X1,esk6_5(esk1_0,esk2_0,X2,esk4_0,X1))
| ~ r2_hidden(X1,esk4_0)
| ~ r1_closure3(esk1_0,esk2_0,X2,esk4_0)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8])]) ).
cnf(c_0_20,negated_conjecture,
r2_hidden(esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]) ).
cnf(c_0_21,plain,
( r1_closure3(X2,X1,X3,X4)
| ~ m1_pboole(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
| ~ r1_tarski(esk7_4(X2,X1,X3,X4),X5)
| ~ r2_hidden(X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk4_0,X2),X1)
| ~ r2_hidden(X2,esk4_0)
| ~ r1_closure3(esk1_0,esk2_0,X1,esk4_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_8])]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ r1_tarski(X4,X5)
| ~ r1_tarski(X5,X6)
| r1_tarski(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_24,negated_conjecture,
( r1_tarski(esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)),esk6_5(esk1_0,esk2_0,X1,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))))
| ~ r1_closure3(esk1_0,esk2_0,X1,esk4_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
r1_closure3(esk1_0,esk2_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( r1_tarski(X1,esk6_5(esk1_0,esk2_0,X2,esk3_0,X1))
| ~ r2_hidden(X1,esk3_0)
| ~ r1_closure3(esk1_0,esk2_0,X2,esk3_0)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_8])]) ).
cnf(c_0_27,negated_conjecture,
( r1_closure3(esk1_0,esk2_0,X1,esk3_0)
| ~ r1_tarski(esk7_4(esk1_0,esk2_0,X1,esk3_0),X2)
| ~ r2_hidden(X2,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_7]),c_0_8])]) ).
cnf(c_0_28,negated_conjecture,
( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))),X1)
| ~ r1_closure3(esk1_0,esk2_0,X1,esk4_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,plain,
( r1_tarski(X1,X2)
| ~ r1_tarski(X3,X2)
| ~ r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
r1_tarski(esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)),esk6_5(esk1_0,esk2_0,esk5_0,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_11])]) ).
cnf(c_0_31,negated_conjecture,
( r1_tarski(esk7_4(esk1_0,esk2_0,esk5_0,esk3_0),esk6_5(esk1_0,esk2_0,X1,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)))
| ~ r1_closure3(esk1_0,esk2_0,X1,esk3_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1_tarski(esk7_4(esk1_0,esk2_0,esk5_0,esk3_0),X1)
| ~ r2_hidden(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_11]),c_0_12]) ).
cnf(c_0_33,negated_conjecture,
r2_hidden(esk6_5(esk1_0,esk2_0,esk5_0,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_11])]) ).
cnf(c_0_34,negated_conjecture,
( r1_tarski(X1,esk6_5(esk1_0,esk2_0,esk5_0,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))))
| ~ r1_tarski(X1,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
r1_tarski(esk7_4(esk1_0,esk2_0,esk5_0,esk3_0),esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_18]),c_0_16])]) ).
cnf(c_0_36,negated_conjecture,
~ r1_tarski(esk7_4(esk1_0,esk2_0,esk5_0,esk3_0),esk6_5(esk1_0,esk2_0,esk5_0,esk4_0,esk6_5(esk1_0,esk2_0,esk4_0,esk3_0,esk7_4(esk1_0,esk2_0,esk5_0,esk3_0)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG223+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 7 23:21:25 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.39 eprover: CPU time limit exceeded, terminating
% 0.33/23.39 eprover: CPU time limit exceeded, terminating
% 0.46/46.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.58/69.42 eprover: CPU time limit exceeded, terminating
% 0.58/69.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.72/92.44 eprover: CPU time limit exceeded, terminating
% 0.72/92.45 eprover: CPU time limit exceeded, terminating
% 0.72/92.47 eprover: CPU time limit exceeded, terminating
% 0.72/92.47 eprover: CPU time limit exceeded, terminating
% 0.72/93.90 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.72/93.90
% 0.72/93.90 # Failure: Resource limit exceeded (time)
% 0.72/93.90 # OLD status Res
% 0.72/93.90 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.72/93.90 # Preprocessing time : 0.010 s
% 0.72/93.90 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.72/93.90 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.72/93.90 # Preprocessing time : 0.008 s
% 0.72/93.90
% 0.72/93.90 # Failure: Out of unprocessed clauses!
% 0.72/93.90 # OLD status GaveUp
% 0.72/93.90 # Parsed axioms : 42
% 0.72/93.90 # Removed by relevancy pruning/SinE : 34
% 0.72/93.90 # Initial clauses : 19
% 0.72/93.90 # Removed in clause preprocessing : 0
% 0.72/93.90 # Initial clauses in saturation : 19
% 0.72/93.90 # Processed clauses : 32
% 0.72/93.90 # ...of these trivial : 0
% 0.72/93.90 # ...subsumed : 6
% 0.72/93.90 # ...remaining for further processing : 26
% 0.72/93.90 # Other redundant clauses eliminated : 0
% 0.72/93.90 # Clauses deleted for lack of memory : 0
% 0.72/93.90 # Backward-subsumed : 1
% 0.72/93.90 # Backward-rewritten : 0
% 0.72/93.90 # Generated clauses : 15
% 0.72/93.90 # ...of the previous two non-trivial : 15
% 0.72/93.90 # Contextual simplify-reflections : 9
% 0.72/93.90 # Paramodulations : 15
% 0.72/93.90 # Factorizations : 0
% 0.72/93.90 # Equation resolutions : 0
% 0.72/93.90 # Current number of processed clauses : 25
% 0.72/93.90 # Positive orientable unit clauses : 10
% 0.72/93.90 # Positive unorientable unit clauses: 0
% 0.72/93.90 # Negative unit clauses : 2
% 0.72/93.90 # Non-unit-clauses : 13
% 0.72/93.90 # Current number of unprocessed clauses: 0
% 0.72/93.90 # ...number of literals in the above : 0
% 0.72/93.90 # Current number of archived formulas : 0
% 0.72/93.90 # Current number of archived clauses : 1
% 0.72/93.90 # Clause-clause subsumption calls (NU) : 123
% 0.72/93.90 # Rec. Clause-clause subsumption calls : 29
% 0.72/93.90 # Non-unit clause-clause subsumptions : 16
% 0.72/93.90 # Unit Clause-clause subsumption calls : 0
% 0.72/93.90 # Rewrite failures with RHS unbound : 0
% 0.72/93.90 # BW rewrite match attempts : 1
% 0.72/93.90 # BW rewrite match successes : 0
% 0.72/93.90 # Condensation attempts : 0
% 0.72/93.90 # Condensation successes : 0
% 0.72/93.90 # Termbank termtop insertions : 2216
% 0.72/93.90
% 0.72/93.90 # -------------------------------------------------
% 0.72/93.90 # User time : 0.007 s
% 0.72/93.90 # System time : 0.002 s
% 0.72/93.90 # Total time : 0.009 s
% 0.72/93.90 # Maximum resident set size: 2984 pages
% 0.72/93.90 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.72/93.90
% 0.72/93.90 # Failure: Resource limit exceeded (time)
% 0.72/93.90 # OLD status Res
% 0.72/93.90 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.72/93.90 # Preprocessing time : 0.008 s
% 0.72/93.90 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.72/93.90
% 0.72/93.90 # Failure: Resource limit exceeded (time)
% 0.72/93.90 # OLD status Res
% 0.72/93.90 # Preprocessing time : 0.017 s
% 0.72/93.90 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.72/93.90
% 0.72/93.90 # Failure: Resource limit exceeded (time)
% 0.72/93.90 # OLD status Res
% 0.72/93.90 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.72/93.90 # Preprocessing time : 0.009 s
% 0.72/93.90 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.72/93.90 # Preprocessing time : 0.010 s
% 0.72/93.90
% 0.72/93.90 # Proof found!
% 0.72/93.90 # SZS status Theorem
% 0.72/93.90 # SZS output start CNFRefutation
% See solution above
% 0.72/93.90 # Proof object total steps : 38
% 0.72/93.90 # Proof object clause steps : 31
% 0.72/93.90 # Proof object formula steps : 7
% 0.72/93.90 # Proof object conjectures : 29
% 0.72/93.90 # Proof object clause conjectures : 26
% 0.72/93.90 # Proof object formula conjectures : 3
% 0.72/93.90 # Proof object initial clauses used : 12
% 0.72/93.90 # Proof object initial formulas used : 3
% 0.72/93.90 # Proof object generating inferences : 19
% 0.72/93.90 # Proof object simplifying inferences : 23
% 0.72/93.90 # Training examples: 0 positive, 0 negative
% 0.72/93.90 # Parsed axioms : 42
% 0.72/93.90 # Removed by relevancy pruning/SinE : 0
% 0.72/93.90 # Initial clauses : 83
% 0.72/93.90 # Removed in clause preprocessing : 6
% 0.72/93.90 # Initial clauses in saturation : 77
% 0.72/93.90 # Processed clauses : 13006
% 0.72/93.90 # ...of these trivial : 76
% 0.72/93.90 # ...subsumed : 7922
% 0.72/93.90 # ...remaining for further processing : 5008
% 0.72/93.90 # Other redundant clauses eliminated : 0
% 0.72/93.90 # Clauses deleted for lack of memory : 0
% 0.72/93.90 # Backward-subsumed : 288
% 0.72/93.90 # Backward-rewritten : 122
% 0.72/93.90 # Generated clauses : 79396
% 0.72/93.90 # ...of the previous two non-trivial : 75938
% 0.72/93.90 # Contextual simplify-reflections : 0
% 0.72/93.90 # Paramodulations : 79316
% 0.72/93.90 # Factorizations : 0
% 0.72/93.90 # Equation resolutions : 0
% 0.72/93.90 # Current number of processed clauses : 4518
% 0.72/93.90 # Positive orientable unit clauses : 330
% 0.72/93.90 # Positive unorientable unit clauses: 0
% 0.72/93.90 # Negative unit clauses : 85
% 0.72/93.90 # Non-unit-clauses : 4103
% 0.72/93.90 # Current number of unprocessed clauses: 52639
% 0.72/93.90 # ...number of literals in the above : 217616
% 0.72/93.90 # Current number of archived formulas : 0
% 0.72/93.90 # Current number of archived clauses : 490
% 0.72/93.90 # Clause-clause subsumption calls (NU) : 593299
% 0.72/93.90 # Rec. Clause-clause subsumption calls : 442017
% 0.72/93.90 # Non-unit clause-clause subsumptions : 6008
% 0.72/93.90 # Unit Clause-clause subsumption calls : 27885
% 0.72/93.90 # Rewrite failures with RHS unbound : 0
% 0.72/93.90 # BW rewrite match attempts : 13251
% 0.72/93.90 # BW rewrite match successes : 33
% 0.72/93.90 # Condensation attempts : 0
% 0.72/93.90 # Condensation successes : 0
% 0.72/93.90 # Termbank termtop insertions : 1924703
% 0.72/93.90
% 0.72/93.90 # -------------------------------------------------
% 0.72/93.90 # User time : 1.113 s
% 0.72/93.90 # System time : 0.030 s
% 0.72/93.90 # Total time : 1.143 s
% 0.72/93.90 # Maximum resident set size: 53416 pages
% 0.72/115.45 eprover: CPU time limit exceeded, terminating
% 0.72/115.46 eprover: CPU time limit exceeded, terminating
% 0.72/115.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.47 eprover: No such file or directory
% 0.72/115.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.47 eprover: No such file or directory
% 0.72/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.48 eprover: No such file or directory
% 0.72/115.48 eprover: CPU time limit exceeded, terminating
% 0.72/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.48 eprover: No such file or directory
% 0.72/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.48 eprover: No such file or directory
% 0.72/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.48 eprover: No such file or directory
% 0.72/115.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.49 eprover: No such file or directory
% 0.72/115.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.49 eprover: No such file or directory
% 0.72/115.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.72/115.49 eprover: No such file or directory
% 0.72/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.50 eprover: No such file or directory
% 0.72/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.50 eprover: No such file or directory
% 0.72/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.50 eprover: No such file or directory
% 0.72/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.50 eprover: No such file or directory
% 0.72/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.50 eprover: No such file or directory
% 0.72/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.51 eprover: No such file or directory
% 0.72/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.51 eprover: No such file or directory
% 0.72/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.51 eprover: No such file or directory
% 0.72/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.51 eprover: No such file or directory
% 0.72/115.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.52 eprover: No such file or directory
% 0.72/115.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.52 eprover: No such file or directory
% 0.72/115.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.72/115.52 eprover: No such file or directory
%------------------------------------------------------------------------------