TSTP Solution File: SET079+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET079+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 08:05:22 EDT 2012
% Result : Theorem 0.41s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 63 ( 4 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 62 ( 25 ~; 21 |; 13 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : ~ member(X1,null_class),
file('/tmp/tmp0hdsRT/sel_SET079+1.p_4',null_class_defn) ).
fof(4,axiom,
! [X1] : equal(singleton(X1),unordered_pair(X1,X1)),
file('/tmp/tmp0hdsRT/sel_SET079+1.p_4',singleton_set_defn) ).
fof(5,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( equal(X3,X1)
| equal(X3,X2) ) ) ),
file('/tmp/tmp0hdsRT/sel_SET079+1.p_4',unordered_pair_defn) ).
fof(7,conjecture,
! [X1] :
( member(X1,universal_class)
=> ~ equal(singleton(X1),null_class) ),
file('/tmp/tmp0hdsRT/sel_SET079+1.p_4',corollary_to_set_in_its_singleton) ).
fof(8,negated_conjecture,
~ ! [X1] :
( member(X1,universal_class)
=> ~ equal(singleton(X1),null_class) ),
inference(assume_negation,[status(cth)],[7]) ).
fof(9,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(12,plain,
! [X2] : ~ member(X2,null_class),
inference(variable_rename,[status(thm)],[9]) ).
cnf(13,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[12]) ).
fof(20,plain,
! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(21,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[20]) ).
fof(22,plain,
! [X3,X1,X2] :
( ( ~ member(X3,unordered_pair(X1,X2))
| ( member(X3,universal_class)
& ( equal(X3,X1)
| equal(X3,X2) ) ) )
& ( ~ member(X3,universal_class)
| ( ~ equal(X3,X1)
& ~ equal(X3,X2) )
| member(X3,unordered_pair(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(23,plain,
! [X4,X5,X6] :
( ( ~ member(X4,unordered_pair(X5,X6))
| ( member(X4,universal_class)
& ( equal(X4,X5)
| equal(X4,X6) ) ) )
& ( ~ member(X4,universal_class)
| ( ~ equal(X4,X5)
& ~ equal(X4,X6) )
| member(X4,unordered_pair(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,plain,
! [X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( equal(X4,X5)
| equal(X4,X6)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( ~ equal(X4,X5)
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( ~ equal(X4,X6)
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(25,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(31,negated_conjecture,
? [X1] :
( member(X1,universal_class)
& equal(singleton(X1),null_class) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(32,negated_conjecture,
? [X2] :
( member(X2,universal_class)
& equal(singleton(X2),null_class) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,negated_conjecture,
( member(esk1_0,universal_class)
& equal(singleton(esk1_0),null_class) ),
inference(skolemize,[status(esa)],[32]) ).
cnf(34,negated_conjecture,
singleton(esk1_0) = null_class,
inference(split_conjunct,[status(thm)],[33]) ).
cnf(35,negated_conjecture,
member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(36,negated_conjecture,
unordered_pair(esk1_0,esk1_0) = null_class,
inference(rw,[status(thm)],[34,21,theory(equality)]),
[unfolding] ).
cnf(43,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[25,theory(equality)]) ).
cnf(54,negated_conjecture,
( member(esk1_0,null_class)
| ~ member(esk1_0,universal_class) ),
inference(spm,[status(thm)],[43,36,theory(equality)]) ).
cnf(56,negated_conjecture,
( member(esk1_0,null_class)
| $false ),
inference(rw,[status(thm)],[54,35,theory(equality)]) ).
cnf(57,negated_conjecture,
member(esk1_0,null_class),
inference(cn,[status(thm)],[56,theory(equality)]) ).
cnf(58,negated_conjecture,
$false,
inference(sr,[status(thm)],[57,13,theory(equality)]) ).
cnf(59,negated_conjecture,
$false,
58,
[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/SET079+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp0hdsRT/sel_SET079+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/tmp0hdsRT/sel_SET079+1.p_1']
% -prover status CounterSatisfiable
% -running prover on /tmp/tmp0hdsRT/sel_SET079+1.p_2 with time limit 89
% -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=89', '/tmp/tmp0hdsRT/sel_SET079+1.p_2']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp0hdsRT/sel_SET079+1.p_3 with time limit 119
% -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=119', '/tmp/tmp0hdsRT/sel_SET079+1.p_3']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp0hdsRT/sel_SET079+1.p_4 with time limit 149
% -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=149', '/tmp/tmp0hdsRT/sel_SET079+1.p_4']
% -prover status Theorem
% Problem SET079+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET079+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET079+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
%
%------------------------------------------------------------------------------