TSTP Solution File: SET091+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET091+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n187.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.5MB
% OS : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 14:40:14 EST 2019
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 49 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 14 |; 12 &)
% ( 0 <=>; 2 =>; 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X2] :
( member(member_of(X2),universal_class)
| equal(member_of(X2),X2) ),
file('/export/starexec/sandbox/tmp/tmpUKLkE7/sel_theBenchmark.p_1',member_universal_self) ).
fof(4,axiom,
! [X2] :
( equal(singleton(member_of(X2)),X2)
| equal(member_of(X2),X2) ),
file('/export/starexec/sandbox/tmp/tmpUKLkE7/sel_theBenchmark.p_1',singleton_self) ).
fof(5,conjecture,
! [X2,X3] :
( ( ~ ? [X1] :
( member(X1,universal_class)
& equal(X2,singleton(X1)) )
& equal(X2,X3) )
=> equal(member_of(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmpUKLkE7/sel_theBenchmark.p_1',member_when_not_a_singleton) ).
fof(6,negated_conjecture,
~ ! [X2,X3] :
( ( ~ ? [X1] :
( member(X1,universal_class)
& equal(X2,singleton(X1)) )
& equal(X2,X3) )
=> equal(member_of(X2),X3) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(13,plain,
! [X3] :
( member(member_of(X3),universal_class)
| equal(member_of(X3),X3) ),
inference(variable_rename,[status(thm)],[3]) ).
cnf(14,plain,
( member_of(X1) = X1
| member(member_of(X1),universal_class) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X3] :
( equal(singleton(member_of(X3)),X3)
| equal(member_of(X3),X3) ),
inference(variable_rename,[status(thm)],[4]) ).
cnf(16,plain,
( member_of(X1) = X1
| singleton(member_of(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(17,negated_conjecture,
? [X2,X3] :
( ! [X1] :
( ~ member(X1,universal_class)
| ~ equal(X2,singleton(X1)) )
& equal(X2,X3)
& ~ equal(member_of(X2),X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(18,negated_conjecture,
? [X4,X5] :
( ! [X6] :
( ~ member(X6,universal_class)
| ~ equal(X4,singleton(X6)) )
& equal(X4,X5)
& ~ equal(member_of(X4),X5) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(19,negated_conjecture,
( ! [X6] :
( ~ member(X6,universal_class)
| ~ equal(esk1_0,singleton(X6)) )
& equal(esk1_0,esk2_0)
& ~ equal(member_of(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[18]) ).
fof(20,negated_conjecture,
! [X6] :
( ( ~ member(X6,universal_class)
| ~ equal(esk1_0,singleton(X6)) )
& equal(esk1_0,esk2_0)
& ~ equal(member_of(esk1_0),esk2_0) ),
inference(shift_quantors,[status(thm)],[19]) ).
cnf(21,negated_conjecture,
member_of(esk1_0) != esk2_0,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(23,negated_conjecture,
( esk1_0 != singleton(X1)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(24,negated_conjecture,
member_of(esk1_0) != esk1_0,
inference(rw,[status(thm)],[21,22,theory(equality)]) ).
cnf(26,negated_conjecture,
( member_of(X1) = X1
| X1 != esk1_0
| ~ member(member_of(X1),universal_class) ),
inference(spm,[status(thm)],[23,16,theory(equality)]) ).
cnf(31,negated_conjecture,
( member_of(X1) = X1
| X1 != esk1_0 ),
inference(csr,[status(thm)],[26,14]) ).
cnf(32,negated_conjecture,
member_of(esk1_0) = esk1_0,
inference(er,[status(thm)],[31,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
inference(sr,[status(thm)],[32,24,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
33,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET091+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.26 % Computer : n187.star.cs.uiowa.edu
% 0.03/0.26 % Model : x86_64 x86_64
% 0.03/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.26 % Memory : 32218.5MB
% 0.03/0.26 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.26 % CPULimit : 300
% 0.03/0.26 % DateTime : Sun Feb 24 10:00:41 CST 2019
% 0.03/0.27 % CPUTime :
% 0.08/0.31 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.31 --creating new selector for [SET005+0.ax]
% 0.08/0.41 -running prover on /export/starexec/sandbox/tmp/tmpUKLkE7/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.41 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpUKLkE7/sel_theBenchmark.p_1']
% 0.08/0.41 -prover status Theorem
% 0.08/0.41 Problem theBenchmark.p solved in phase 0.
% 0.08/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.41 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.42 Solved 1 out of 1.
% 0.08/0.42 # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.42 # SZS status Theorem
% 0.08/0.42 # SZS output start CNFRefutation.
% See solution above
% 0.08/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------