TSTP Solution File: SWV377+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV377+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:29:32 EST 2010
% Result : Theorem 239.66s
% Output : CNFRefutation 239.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 44 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 8 |; 5 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 58 ( 7 sgn 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/tmp/tmpUSJYZW/sel_SWV377+1.p_5',ax42) ).
fof(12,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmpUSJYZW/sel_SWV377+1.p_5',ax40) ).
fof(18,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/tmp/tmpUSJYZW/sel_SWV377+1.p_5',ax41) ).
fof(32,conjecture,
! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
file('/tmp/tmpUSJYZW/sel_SWV377+1.p_5',l13_co) ).
fof(33,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(37,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(39,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[33,theory(equality)]) ).
fof(54,plain,
! [X5,X6,X7,X8] : insert_cpq(triple(X5,X6,X7),X8) = triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),
inference(variable_rename,[status(thm)],[6]) ).
cnf(55,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[54]) ).
fof(74,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(75,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[74]) ).
cnf(77,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[75]) ).
fof(93,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(94,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[93]) ).
cnf(95,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(132,negated_conjecture,
? [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
& ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(133,negated_conjecture,
? [X5,X6,X7,X8] :
( ~ ok(triple(X5,X6,X7))
& ok(insert_cpq(triple(X5,X6,X7),X8)) ),
inference(variable_rename,[status(thm)],[132]) ).
fof(134,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
inference(skolemize,[status(esa)],[133]) ).
cnf(135,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[134]) ).
cnf(136,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[134]) ).
cnf(142,negated_conjecture,
bad = esk3_0,
inference(spm,[status(thm)],[136,95,theory(equality)]) ).
cnf(162,plain,
~ ok(insert_cpq(triple(X1,X3,bad),X2)),
inference(spm,[status(thm)],[77,55,theory(equality)]) ).
cnf(211,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
inference(rw,[status(thm)],[135,142,theory(equality)]) ).
cnf(215,negated_conjecture,
$false,
inference(sr,[status(thm)],[211,162,theory(equality)]) ).
cnf(216,negated_conjecture,
$false,
215,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV377+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/tmpUSJYZW/sel_SWV377+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpUSJYZW/sel_SWV377+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/tmpUSJYZW/sel_SWV377+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/tmpUSJYZW/sel_SWV377+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/tmpUSJYZW/sel_SWV377+1.p_5 with time limit 54
% -prover status Theorem
% Problem SWV377+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV377+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV377+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
%
%------------------------------------------------------------------------------