TSTP Solution File: SWV391+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV391+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 12:35:11 EST 2010
% Result : Theorem 240.04s
% Output : CNFRefutation 240.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 78 ( 10 unt; 0 def)
% Number of atoms : 240 ( 18 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 265 ( 103 ~; 117 |; 31 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 225 ( 15 sgn 130 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',ax45) ).
fof(13,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',ax44) ).
fof(15,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',ax40) ).
fof(20,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',totality) ).
fof(21,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',stricly_smaller_definition) ).
fof(36,conjecture,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',l27_co) ).
fof(37,axiom,
! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',l27_l33) ).
fof(38,axiom,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',l27_l30) ).
fof(39,axiom,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',l27_li4142) ).
fof(40,axiom,
! [X1,X2,X3] :
( pair_in_list(X1,X2,X3)
=> ! [X4] :
( contains_slb(X1,X4)
=> ( pair_in_list(remove_slb(X1,X4),X2,X3)
| X2 = X4 ) ) ),
file('/tmp/tmpgFEXy1/sel_SWV391+1.p_5',l27_li2829) ).
fof(41,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[36]) ).
fof(44,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(83,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(84,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ strictly_less_than(X8,lookup_slb(X6,X8))
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
inference(variable_rename,[status(thm)],[83]) ).
cnf(85,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(86,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
| ~ less_than(lookup_slb(X2,X4),X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(87,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ less_than(lookup_slb(X6,X8),X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
inference(variable_rename,[status(thm)],[86]) ).
cnf(88,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(91,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(92,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[91]) ).
cnf(94,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[92]) ).
fof(109,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(110,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(111,plain,
! [X1,X2] :
( ( ~ strictly_less_than(X1,X2)
| ( less_than(X1,X2)
& ~ less_than(X2,X1) ) )
& ( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[44]) ).
fof(112,plain,
! [X3,X4] :
( ( ~ strictly_less_than(X3,X4)
| ( less_than(X3,X4)
& ~ less_than(X4,X3) ) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [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)],[112]) ).
cnf(114,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(155,negated_conjecture,
? [X1,X2,X3,X4] :
( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4))
& ~ check_cpq(triple(X1,X2,X3)) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(156,negated_conjecture,
? [X5,X6,X7,X8] :
( check_cpq(remove_cpq(triple(X5,X6,X7),X8))
& ok(remove_cpq(triple(X5,X6,X7),X8))
& ~ check_cpq(triple(X5,X6,X7)) ),
inference(variable_rename,[status(thm)],[155]) ).
fof(157,negated_conjecture,
( check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[156]) ).
cnf(158,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(159,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(160,negated_conjecture,
check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[157]) ).
fof(161,plain,
! [X1,X2,X3,X4] :
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| contains_slb(X2,X4) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(162,plain,
! [X5,X6,X7,X8] :
( ~ ok(remove_cpq(triple(X5,X6,X7),X8))
| contains_slb(X6,X8) ),
inference(variable_rename,[status(thm)],[161]) ).
cnf(163,plain,
( contains_slb(X1,X2)
| ~ ok(remove_cpq(triple(X3,X1,X4),X2)) ),
inference(split_conjunct,[status(thm)],[162]) ).
fof(164,plain,
! [X1,X2,X3,X4] :
( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ! [X5] :
( ~ pair_in_list(X2,X4,X5)
| less_than(X5,X4) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(165,plain,
! [X6,X7,X8,X9] :
( ~ check_cpq(remove_cpq(triple(X6,X7,X8),X9))
| ~ ok(remove_cpq(triple(X6,X7,X8),X9))
| ! [X10] :
( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) ) ),
inference(variable_rename,[status(thm)],[164]) ).
fof(166,plain,
! [X6,X7,X8,X9,X10] :
( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9)
| ~ check_cpq(remove_cpq(triple(X6,X7,X8),X9))
| ~ ok(remove_cpq(triple(X6,X7,X8),X9)) ),
inference(shift_quantors,[status(thm)],[165]) ).
cnf(167,plain,
( less_than(X5,X4)
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[166]) ).
fof(168,plain,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ! [X4,X5] :
( ~ pair_in_list(X2,X4,X5)
| less_than(X5,X4) ) )
& ( ? [X4,X5] :
( pair_in_list(X2,X4,X5)
& ~ less_than(X5,X4) )
| check_cpq(triple(X1,X2,X3)) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(169,plain,
! [X6,X7,X8] :
( ( ~ check_cpq(triple(X6,X7,X8))
| ! [X9,X10] :
( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) ) )
& ( ? [X11,X12] :
( pair_in_list(X7,X11,X12)
& ~ less_than(X12,X11) )
| check_cpq(triple(X6,X7,X8)) ) ),
inference(variable_rename,[status(thm)],[168]) ).
fof(170,plain,
! [X6,X7,X8] :
( ( ~ check_cpq(triple(X6,X7,X8))
| ! [X9,X10] :
( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) ) )
& ( ( pair_in_list(X7,esk5_3(X6,X7,X8),esk6_3(X6,X7,X8))
& ~ less_than(esk6_3(X6,X7,X8),esk5_3(X6,X7,X8)) )
| check_cpq(triple(X6,X7,X8)) ) ),
inference(skolemize,[status(esa)],[169]) ).
fof(171,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9)
| ~ check_cpq(triple(X6,X7,X8)) )
& ( ( pair_in_list(X7,esk5_3(X6,X7,X8),esk6_3(X6,X7,X8))
& ~ less_than(esk6_3(X6,X7,X8),esk5_3(X6,X7,X8)) )
| check_cpq(triple(X6,X7,X8)) ) ),
inference(shift_quantors,[status(thm)],[170]) ).
fof(172,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9)
| ~ check_cpq(triple(X6,X7,X8)) )
& ( pair_in_list(X7,esk5_3(X6,X7,X8),esk6_3(X6,X7,X8))
| check_cpq(triple(X6,X7,X8)) )
& ( ~ less_than(esk6_3(X6,X7,X8),esk5_3(X6,X7,X8))
| check_cpq(triple(X6,X7,X8)) ) ),
inference(distribute,[status(thm)],[171]) ).
cnf(173,plain,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk6_3(X1,X2,X3),esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[172]) ).
cnf(174,plain,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[172]) ).
cnf(175,plain,
( less_than(X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X5,X4) ),
inference(split_conjunct,[status(thm)],[172]) ).
fof(176,plain,
! [X1,X2,X3] :
( ~ pair_in_list(X1,X2,X3)
| ! [X4] :
( ~ contains_slb(X1,X4)
| pair_in_list(remove_slb(X1,X4),X2,X3)
| X2 = X4 ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(177,plain,
! [X5,X6,X7] :
( ~ pair_in_list(X5,X6,X7)
| ! [X8] :
( ~ contains_slb(X5,X8)
| pair_in_list(remove_slb(X5,X8),X6,X7)
| X6 = X8 ) ),
inference(variable_rename,[status(thm)],[176]) ).
fof(178,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X5,X8)
| pair_in_list(remove_slb(X5,X8),X6,X7)
| X6 = X8
| ~ pair_in_list(X5,X6,X7) ),
inference(shift_quantors,[status(thm)],[177]) ).
cnf(179,plain,
( X2 = X4
| pair_in_list(remove_slb(X1,X4),X2,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(187,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(spm,[status(thm)],[163,159,theory(equality)]) ).
cnf(190,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[114,110]) ).
cnf(224,negated_conjecture,
( less_than(X1,esk4_0)
| ~ pair_in_list(esk2_0,esk4_0,X1)
| ~ check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
inference(spm,[status(thm)],[167,159,theory(equality)]) ).
cnf(226,negated_conjecture,
( less_than(X1,esk4_0)
| ~ pair_in_list(esk2_0,esk4_0,X1)
| $false ),
inference(rw,[status(thm)],[224,160,theory(equality)]) ).
cnf(227,negated_conjecture,
( less_than(X1,esk4_0)
| ~ pair_in_list(esk2_0,esk4_0,X1) ),
inference(cn,[status(thm)],[226,theory(equality)]) ).
cnf(269,plain,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(X3,X4),X2,X1)
| ~ check_cpq(remove_cpq(triple(X5,X3,X6),X4))
| ~ less_than(lookup_slb(X3,X4),X4)
| ~ contains_slb(X3,X4) ),
inference(spm,[status(thm)],[175,88,theory(equality)]) ).
cnf(276,plain,
( ~ ok(remove_cpq(triple(X1,X3,X4),X2))
| ~ strictly_less_than(X2,lookup_slb(X3,X2))
| ~ contains_slb(X3,X2) ),
inference(spm,[status(thm)],[94,85,theory(equality)]) ).
cnf(306,plain,
( ~ ok(remove_cpq(triple(X1,X3,X4),X2))
| ~ strictly_less_than(X2,lookup_slb(X3,X2)) ),
inference(csr,[status(thm)],[276,163]) ).
cnf(307,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0)),
inference(spm,[status(thm)],[306,159,theory(equality)]) ).
cnf(313,negated_conjecture,
less_than(lookup_slb(esk2_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[307,190,theory(equality)]) ).
cnf(3395,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1)
| ~ less_than(lookup_slb(esk2_0,esk4_0),esk4_0)
| ~ contains_slb(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[269,160,theory(equality)]) ).
cnf(3406,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1)
| $false
| ~ contains_slb(esk2_0,esk4_0) ),
inference(rw,[status(thm)],[3395,313,theory(equality)]) ).
cnf(3407,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1)
| $false
| $false ),
inference(rw,[status(thm)],[3406,187,theory(equality)]) ).
cnf(3408,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1) ),
inference(cn,[status(thm)],[3407,theory(equality)]) ).
cnf(3414,plain,
( less_than(X1,X2)
| X2 = esk4_0
| ~ pair_in_list(esk2_0,X2,X1)
| ~ contains_slb(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[3408,179,theory(equality)]) ).
cnf(3417,plain,
( less_than(X1,X2)
| X2 = esk4_0
| ~ pair_in_list(esk2_0,X2,X1)
| $false ),
inference(rw,[status(thm)],[3414,187,theory(equality)]) ).
cnf(3418,plain,
( less_than(X1,X2)
| X2 = esk4_0
| ~ pair_in_list(esk2_0,X2,X1) ),
inference(cn,[status(thm)],[3417,theory(equality)]) ).
cnf(3419,plain,
( esk5_3(X1,esk2_0,X2) = esk4_0
| less_than(esk6_3(X1,esk2_0,X2),esk5_3(X1,esk2_0,X2))
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(spm,[status(thm)],[3418,174,theory(equality)]) ).
cnf(3422,plain,
( esk5_3(X1,esk2_0,X2) = esk4_0
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(csr,[status(thm)],[3419,173]) ).
cnf(3423,plain,
( check_cpq(triple(X1,esk2_0,X2))
| ~ less_than(esk6_3(X1,esk2_0,X2),esk4_0) ),
inference(spm,[status(thm)],[173,3422,theory(equality)]) ).
cnf(3424,plain,
( pair_in_list(esk2_0,esk4_0,esk6_3(X1,esk2_0,X2))
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(spm,[status(thm)],[174,3422,theory(equality)]) ).
cnf(3478,plain,
( less_than(esk6_3(X1,esk2_0,X2),esk4_0)
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(spm,[status(thm)],[227,3424,theory(equality)]) ).
cnf(3537,plain,
check_cpq(triple(X1,esk2_0,X2)),
inference(csr,[status(thm)],[3478,3423]) ).
cnf(3539,negated_conjecture,
$false,
inference(rw,[status(thm)],[158,3537,theory(equality)]) ).
cnf(3540,negated_conjecture,
$false,
inference(cn,[status(thm)],[3539,theory(equality)]) ).
cnf(3541,negated_conjecture,
$false,
3540,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV391+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpgFEXy1/sel_SWV391+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpgFEXy1/sel_SWV391+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpgFEXy1/sel_SWV391+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpgFEXy1/sel_SWV391+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpgFEXy1/sel_SWV391+1.p_5 with time limit 53
% -prover status Theorem
% Problem SWV391+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV391+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV391+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------