TSTP Solution File: SWV390+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV390+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:34:58 EST 2010
% Result : Theorem 240.13s
% Output : CNFRefutation 240.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 100 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 109 ( 47 ~; 39 |; 16 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 123 ( 5 sgn 72 !; 12 ?)
% 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/tmpu0MIk5/sel_SWV390+1.p_5',ax42) ).
fof(13,axiom,
! [X1] : less_than(bottom,X1),
file('/tmp/tmpu0MIk5/sel_SWV390+1.p_5',bottom_smallest) ).
fof(26,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/tmp/tmpu0MIk5/sel_SWV390+1.p_5',ax37) ).
fof(34,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
file('/tmp/tmpu0MIk5/sel_SWV390+1.p_5',l26_co) ).
fof(35,axiom,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/tmp/tmpu0MIk5/sel_SWV390+1.p_5',l26_li4142) ).
fof(36,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(43,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[36,theory(equality)]) ).
fof(58,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(59,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)],[58]) ).
fof(81,plain,
! [X2] : less_than(bottom,X2),
inference(variable_rename,[status(thm)],[13]) ).
cnf(82,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[81]) ).
fof(122,plain,
! [X1,X2,X3,X4,X5] :
( ~ less_than(X5,X4)
| ( ( ~ check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
| check_cpq(triple(X1,X2,X3)) )
& ( ~ check_cpq(triple(X1,X2,X3))
| check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(123,plain,
! [X6,X7,X8,X9,X10] :
( ~ less_than(X10,X9)
| ( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| check_cpq(triple(X6,X7,X8)) )
& ( ~ check_cpq(triple(X6,X7,X8))
| check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) ) ) ),
inference(variable_rename,[status(thm)],[122]) ).
fof(124,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| check_cpq(triple(X6,X7,X8))
| ~ less_than(X10,X9) )
& ( ~ check_cpq(triple(X6,X7,X8))
| check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| ~ less_than(X10,X9) ) ),
inference(distribute,[status(thm)],[123]) ).
cnf(126,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(split_conjunct,[status(thm)],[124]) ).
fof(145,negated_conjecture,
? [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
& ? [X4] : check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(146,negated_conjecture,
? [X5,X6,X7] :
( ~ check_cpq(triple(X5,X6,X7))
& ? [X8] : check_cpq(insert_cpq(triple(X5,X6,X7),X8)) ),
inference(variable_rename,[status(thm)],[145]) ).
fof(147,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
inference(skolemize,[status(esa)],[146]) ).
cnf(148,negated_conjecture,
check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[147]) ).
cnf(149,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[147]) ).
fof(150,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)],[35]) ).
fof(151,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)],[150]) ).
fof(152,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)],[151]) ).
fof(153,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)],[152]) ).
fof(154,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)],[153]) ).
cnf(155,plain,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk6_3(X1,X2,X3),esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(156,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)],[154]) ).
cnf(157,plain,
( less_than(X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X5,X4) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(195,plain,
( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
| ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2))
| ~ less_than(bottom,X2) ),
inference(spm,[status(thm)],[126,59,theory(equality)]) ).
cnf(197,plain,
( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
| ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2))
| $false ),
inference(rw,[status(thm)],[195,82,theory(equality)]) ).
cnf(198,plain,
( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
| ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2)) ),
inference(cn,[status(thm)],[197,theory(equality)]) ).
cnf(816,negated_conjecture,
check_cpq(triple(insert_pqp(esk1_0,esk4_0),esk2_0,esk3_0)),
inference(spm,[status(thm)],[198,148,theory(equality)]) ).
cnf(844,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk2_0,X2,X1) ),
inference(spm,[status(thm)],[157,816,theory(equality)]) ).
cnf(846,plain,
( 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)],[844,156,theory(equality)]) ).
cnf(4601,plain,
check_cpq(triple(X1,esk2_0,X2)),
inference(csr,[status(thm)],[846,155]) ).
cnf(4605,negated_conjecture,
$false,
inference(rw,[status(thm)],[149,4601,theory(equality)]) ).
cnf(4606,negated_conjecture,
$false,
inference(cn,[status(thm)],[4605,theory(equality)]) ).
cnf(4607,negated_conjecture,
$false,
4606,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV390+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/tmpu0MIk5/sel_SWV390+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpu0MIk5/sel_SWV390+1.p_2 with time limit 80
% -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/tmpu0MIk5/sel_SWV390+1.p_3 with time limit 75
% -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/tmpu0MIk5/sel_SWV390+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/tmpu0MIk5/sel_SWV390+1.p_5 with time limit 53
% -prover status Theorem
% Problem SWV390+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV390+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV390+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
%
%------------------------------------------------------------------------------