%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV380+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:31:52 EST 2010
% Result : Theorem 0.42s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 81 ( 16 unt; 0 def)
% Number of atoms : 199 ( 71 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 181 ( 63 ~; 84 |; 19 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 171 ( 31 sgn 115 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,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('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax49) ).
fof(2,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('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax48) ).
fof(6,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax41) ).
fof(11,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax40) ).
fof(12,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('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax47) ).
fof(14,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax46) ).
fof(15,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax52) ).
fof(16,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',totality) ).
fof(17,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',stricly_smaller_definition) ).
fof(25,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',ax51) ).
fof(28,axiom,
! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',l16_l14) ).
fof(29,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ),
file('/tmp/tmp67aXUR/sel_SWV380+1.p_1',l16_co) ).
fof(30,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(32,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(34,plain,
! [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) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(35,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(36,plain,
! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(37,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(removemin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(38,plain,
! [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) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(39,plain,
! [X5,X6,X7,X8] :
( 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(variable_rename,[status(thm)],[38]) ).
cnf(40,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)],[39]) ).
fof(41,plain,
! [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) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(42,plain,
! [X5,X6,X7,X8] :
( 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(variable_rename,[status(thm)],[41]) ).
cnf(43,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)],[42]) ).
fof(52,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(53,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[52]) ).
cnf(54,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(68,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(69,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[68]) ).
cnf(71,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(72,plain,
! [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) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(73,plain,
! [X5,X6,X7,X8] :
( 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(variable_rename,[status(thm)],[72]) ).
cnf(74,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)],[73]) ).
fof(77,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[14]) ).
cnf(78,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[77]) ).
fof(79,plain,
! [X2] : removemin_cpq_eff(X2) = remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(80,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[79]) ).
fof(81,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(82,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(83,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)],[35]) ).
fof(84,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)],[83]) ).
fof(85,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)],[84]) ).
cnf(86,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[85]) ).
fof(110,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(111,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(variable_rename,[status(thm)],[110]) ).
cnf(112,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[111]) ).
fof(121,plain,
! [X1,X2,X3,X4] :
( ok(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(122,plain,
! [X5,X6,X7,X8] :
( ok(triple(X5,X6,X7))
| ~ ok(remove_cpq(triple(X5,X6,X7),X8)) ),
inference(variable_rename,[status(thm)],[121]) ).
cnf(123,plain,
( ok(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(split_conjunct,[status(thm)],[122]) ).
fof(124,negated_conjecture,
? [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
& ok(removemin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(125,negated_conjecture,
? [X4,X5,X6] :
( ~ ok(triple(X4,X5,X6))
& ok(removemin_cpq_eff(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[124]) ).
fof(126,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[125]) ).
cnf(127,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(128,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(129,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[127,80,theory(equality)]),
[unfolding] ).
cnf(131,negated_conjecture,
bad = esk3_0,
inference(spm,[status(thm)],[128,54,theory(equality)]) ).
cnf(138,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[86,82]) ).
cnf(179,plain,
( findmin_cpq_eff(triple(X1,X2,X4)) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[74,74,theory(equality)]) ).
cnf(181,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[43,74]) ).
cnf(183,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[181,138,theory(equality)]) ).
cnf(189,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_cpq_res(triple(esk1_0,esk2_0,bad)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[129,131,theory(equality)]),131,theory(equality)]) ).
cnf(191,negated_conjecture,
( ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_pqp_res(esk1_0)))
| create_slb = esk2_0 ),
inference(spm,[status(thm)],[189,112,theory(equality)]) ).
cnf(254,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[191,179,theory(equality)]) ).
cnf(273,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[254,74,theory(equality)]) ).
cnf(290,negated_conjecture,
( ok(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))
| esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[123,273,theory(equality)]) ).
cnf(293,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[290,71,theory(equality)]) ).
cnf(1085,plain,
( findmin_cpq_eff(triple(X1,X2,X4)) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[183,183,theory(equality)]) ).
cnf(2913,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[191,1085,theory(equality)]) ).
cnf(3035,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[2913,183,theory(equality)]) ).
cnf(3148,negated_conjecture,
( ok(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))
| esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[123,3035,theory(equality)]) ).
cnf(3153,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[3148,71,theory(equality)]) ).
cnf(3156,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| create_slb = esk2_0
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[40,3153,theory(equality)]) ).
cnf(3296,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[3156,293]) ).
cnf(3297,negated_conjecture,
( esk2_0 = create_slb
| ~ ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))) ),
inference(spm,[status(thm)],[71,3296,theory(equality)]) ).
cnf(3299,negated_conjecture,
( ok(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| esk2_0 = create_slb
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2)) ),
inference(spm,[status(thm)],[123,3296,theory(equality)]) ).
cnf(3390,negated_conjecture,
( esk2_0 = create_slb
| ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))) ),
inference(spm,[status(thm)],[3299,189,theory(equality)]) ).
cnf(3401,negated_conjecture,
esk2_0 = create_slb,
inference(csr,[status(thm)],[3390,3297]) ).
cnf(3402,negated_conjecture,
ok(remove_cpq(triple(esk1_0,create_slb,bad),findmin_cpq_res(triple(esk1_0,create_slb,bad)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[189,3401,theory(equality)]),78,theory(equality)]),3401,theory(equality)]) ).
cnf(3471,negated_conjecture,
ok(triple(esk1_0,create_slb,bad)),
inference(spm,[status(thm)],[123,3402,theory(equality)]) ).
cnf(3474,negated_conjecture,
$false,
inference(sr,[status(thm)],[3471,71,theory(equality)]) ).
cnf(3475,negated_conjecture,
$false,
3474,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV380+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmp67aXUR/sel_SWV380+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV380+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV380+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV380+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
%
%------------------------------------------------------------------------------