TSTP Solution File: SWV405+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV405+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:39:12 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 54 ( 22 ~; 18 |; 10 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 40 ( 4 sgn 28 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/tmp/tmpus-T6i/sel_SWV405+1.p_1',ax36) ).
fof(9,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('/tmp/tmpus-T6i/sel_SWV405+1.p_1',ax22) ).
fof(10,conjecture,
! [X1,X2] :
( check_cpq(triple(X1,create_slb,X2))
<=> ! [X3,X4] :
( pair_in_list(create_slb,X3,X4)
=> less_than(X4,X3) ) ),
file('/tmp/tmpus-T6i/sel_SWV405+1.p_1',l41_co) ).
fof(11,negated_conjecture,
~ ! [X1,X2] :
( check_cpq(triple(X1,create_slb,X2))
<=> ! [X3,X4] :
( pair_in_list(create_slb,X3,X4)
=> less_than(X4,X3) ) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(13,plain,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(19,plain,
! [X3,X4] : check_cpq(triple(X3,create_slb,X4)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(20,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[19]) ).
fof(43,plain,
! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
inference(variable_rename,[status(thm)],[13]) ).
cnf(44,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,negated_conjecture,
? [X1,X2] :
( ( ~ check_cpq(triple(X1,create_slb,X2))
| ? [X3,X4] :
( pair_in_list(create_slb,X3,X4)
& ~ less_than(X4,X3) ) )
& ( check_cpq(triple(X1,create_slb,X2))
| ! [X3,X4] :
( ~ pair_in_list(create_slb,X3,X4)
| less_than(X4,X3) ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(46,negated_conjecture,
? [X5,X6] :
( ( ~ check_cpq(triple(X5,create_slb,X6))
| ? [X7,X8] :
( pair_in_list(create_slb,X7,X8)
& ~ less_than(X8,X7) ) )
& ( check_cpq(triple(X5,create_slb,X6))
| ! [X9,X10] :
( ~ pair_in_list(create_slb,X9,X10)
| less_than(X10,X9) ) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,negated_conjecture,
( ( ~ check_cpq(triple(esk1_0,create_slb,esk2_0))
| ( pair_in_list(create_slb,esk3_0,esk4_0)
& ~ less_than(esk4_0,esk3_0) ) )
& ( check_cpq(triple(esk1_0,create_slb,esk2_0))
| ! [X9,X10] :
( ~ pair_in_list(create_slb,X9,X10)
| less_than(X10,X9) ) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,negated_conjecture,
! [X9,X10] :
( ( ~ pair_in_list(create_slb,X9,X10)
| less_than(X10,X9)
| check_cpq(triple(esk1_0,create_slb,esk2_0)) )
& ( ~ check_cpq(triple(esk1_0,create_slb,esk2_0))
| ( pair_in_list(create_slb,esk3_0,esk4_0)
& ~ less_than(esk4_0,esk3_0) ) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
fof(49,negated_conjecture,
! [X9,X10] :
( ( ~ pair_in_list(create_slb,X9,X10)
| less_than(X10,X9)
| check_cpq(triple(esk1_0,create_slb,esk2_0)) )
& ( pair_in_list(create_slb,esk3_0,esk4_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) )
& ( ~ less_than(esk4_0,esk3_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(51,negated_conjecture,
( pair_in_list(create_slb,esk3_0,esk4_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,negated_conjecture,
( pair_in_list(create_slb,esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[51,20,theory(equality)]) ).
cnf(54,negated_conjecture,
pair_in_list(create_slb,esk3_0,esk4_0),
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(55,negated_conjecture,
$false,
inference(sr,[status(thm)],[54,44,theory(equality)]) ).
cnf(56,negated_conjecture,
$false,
55,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV405+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpus-T6i/sel_SWV405+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV405+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV405+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV405+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
%
%------------------------------------------------------------------------------