TSTP Solution File: SET020+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET020+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : manassas.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 08:03:50 EDT 2012
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 67 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 25 ~; 19 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class) )
=> ( equal(first(ordered_pair(X1,X2)),X1)
& equal(second(ordered_pair(X1,X2)),X2) ) ),
file('/tmp/tmpALuWx7/sel_SET020+1.p_1',first_second) ).
fof(4,conjecture,
! [X4,X5,X1] :
( ( member(X4,universal_class)
& member(X5,universal_class)
& equal(X1,ordered_pair(X4,X5)) )
=> ( equal(first(X1),X4)
& equal(second(X1),X5) ) ),
file('/tmp/tmpALuWx7/sel_SET020+1.p_1',unique_1st_and_2nd_in_pair_of_sets1) ).
fof(5,negated_conjecture,
~ ! [X4,X5,X1] :
( ( member(X4,universal_class)
& member(X5,universal_class)
& equal(X1,ordered_pair(X4,X5)) )
=> ( equal(first(X1),X4)
& equal(second(X1),X5) ) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(15,plain,
! [X1,X2] :
( ~ member(X1,universal_class)
| ~ member(X2,universal_class)
| ( equal(first(ordered_pair(X1,X2)),X1)
& equal(second(ordered_pair(X1,X2)),X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(16,plain,
! [X3,X4] :
( ~ member(X3,universal_class)
| ~ member(X4,universal_class)
| ( equal(first(ordered_pair(X3,X4)),X3)
& equal(second(ordered_pair(X3,X4)),X4) ) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,plain,
! [X3,X4] :
( ( equal(first(ordered_pair(X3,X4)),X3)
| ~ member(X3,universal_class)
| ~ member(X4,universal_class) )
& ( equal(second(ordered_pair(X3,X4)),X4)
| ~ member(X3,universal_class)
| ~ member(X4,universal_class) ) ),
inference(distribute,[status(thm)],[16]) ).
cnf(18,plain,
( second(ordered_pair(X2,X1)) = X1
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,plain,
( first(ordered_pair(X2,X1)) = X2
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(20,negated_conjecture,
? [X4,X5,X1] :
( member(X4,universal_class)
& member(X5,universal_class)
& equal(X1,ordered_pair(X4,X5))
& ( ~ equal(first(X1),X4)
| ~ equal(second(X1),X5) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(21,negated_conjecture,
? [X6,X7,X8] :
( member(X6,universal_class)
& member(X7,universal_class)
& equal(X8,ordered_pair(X6,X7))
& ( ~ equal(first(X8),X6)
| ~ equal(second(X8),X7) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,negated_conjecture,
( member(esk1_0,universal_class)
& member(esk2_0,universal_class)
& equal(esk3_0,ordered_pair(esk1_0,esk2_0))
& ( ~ equal(first(esk3_0),esk1_0)
| ~ equal(second(esk3_0),esk2_0) ) ),
inference(skolemize,[status(esa)],[21]) ).
cnf(23,negated_conjecture,
( second(esk3_0) != esk2_0
| first(esk3_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,negated_conjecture,
esk3_0 = ordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(25,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(26,negated_conjecture,
member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(27,negated_conjecture,
( first(ordered_pair(esk1_0,X1)) = esk1_0
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[19,26,theory(equality)]) ).
cnf(29,negated_conjecture,
( second(ordered_pair(esk1_0,X1)) = X1
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[18,26,theory(equality)]) ).
cnf(36,negated_conjecture,
first(ordered_pair(esk1_0,esk2_0)) = esk1_0,
inference(spm,[status(thm)],[27,25,theory(equality)]) ).
cnf(37,negated_conjecture,
first(esk3_0) = esk1_0,
inference(rw,[status(thm)],[36,24,theory(equality)]) ).
cnf(38,negated_conjecture,
( $false
| second(esk3_0) != esk2_0 ),
inference(rw,[status(thm)],[23,37,theory(equality)]) ).
cnf(39,negated_conjecture,
second(esk3_0) != esk2_0,
inference(cn,[status(thm)],[38,theory(equality)]) ).
cnf(43,negated_conjecture,
second(ordered_pair(esk1_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[29,25,theory(equality)]) ).
cnf(44,negated_conjecture,
second(esk3_0) = esk2_0,
inference(rw,[status(thm)],[43,24,theory(equality)]) ).
cnf(45,negated_conjecture,
$false,
inference(sr,[status(thm)],[44,39,theory(equality)]) ).
cnf(46,negated_conjecture,
$false,
45,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET020+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpALuWx7/sel_SET020+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpALuWx7/sel_SET020+1.p_1']
% -prover status Theorem
% Problem SET020+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET020+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET020+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
%
%------------------------------------------------------------------------------