TSTP Solution File: SET090+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET090+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n189.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 185.48s
% Output : CNFRefutation 185.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 81 ( 14 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 76 ( 28 ~; 26 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 3 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( member(X1,unordered_pair(X2,X3))
<=> ( member(X1,universal_class)
& ( equal(X1,X2)
| equal(X1,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4',unordered_pair_defn) ).
fof(3,axiom,
! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
file('/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4',singleton_set_defn) ).
fof(7,axiom,
! [X3] :
( member(X3,universal_class)
=> equal(singleton(member_of(singleton(X3))),singleton(X3)) ),
file('/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4',member_singleton_singleton) ).
fof(10,conjecture,
! [X2,X1] :
( ( member(X1,universal_class)
& equal(X2,singleton(X1)) )
=> equal(member_of(X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4',member_of_singleton) ).
fof(11,negated_conjecture,
~ ! [X2,X1] :
( ( member(X1,universal_class)
& equal(X2,singleton(X1)) )
=> equal(member_of(X2),X1) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(12,plain,
! [X1,X2,X3] :
( ( ~ member(X1,unordered_pair(X2,X3))
| ( member(X1,universal_class)
& ( equal(X1,X2)
| equal(X1,X3) ) ) )
& ( ~ member(X1,universal_class)
| ( ~ equal(X1,X2)
& ~ equal(X1,X3) )
| member(X1,unordered_pair(X2,X3)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(13,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)],[12]) ).
fof(14,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)],[13]) ).
cnf(15,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(21,plain,
! [X3] : equal(singleton(X3),unordered_pair(X3,X3)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(22,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[21]) ).
fof(34,plain,
! [X3] :
( ~ member(X3,universal_class)
| equal(singleton(member_of(singleton(X3))),singleton(X3)) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(35,plain,
! [X4] :
( ~ member(X4,universal_class)
| equal(singleton(member_of(singleton(X4))),singleton(X4)) ),
inference(variable_rename,[status(thm)],[34]) ).
cnf(36,plain,
( singleton(member_of(singleton(X1))) = singleton(X1)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(41,negated_conjecture,
? [X2,X1] :
( member(X1,universal_class)
& equal(X2,singleton(X1))
& ~ equal(member_of(X2),X1) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(42,negated_conjecture,
? [X3,X4] :
( member(X4,universal_class)
& equal(X3,singleton(X4))
& ~ equal(member_of(X3),X4) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,negated_conjecture,
( member(esk2_0,universal_class)
& equal(esk1_0,singleton(esk2_0))
& ~ equal(member_of(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[42]) ).
cnf(44,negated_conjecture,
member_of(esk1_0) != esk2_0,
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,negated_conjecture,
esk1_0 = singleton(esk2_0),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(46,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(47,negated_conjecture,
unordered_pair(esk2_0,esk2_0) = esk1_0,
inference(rw,[status(thm)],[45,22,theory(equality)]),
[unfolding] ).
cnf(50,plain,
( unordered_pair(member_of(unordered_pair(X1,X1)),member_of(unordered_pair(X1,X1))) = unordered_pair(X1,X1)
| ~ member(X1,universal_class) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[36,22,theory(equality)]),22,theory(equality)]),22,theory(equality)]),
[unfolding] ).
cnf(61,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[15,theory(equality)]) ).
cnf(63,negated_conjecture,
unordered_pair(member_of(unordered_pair(esk2_0,esk2_0)),member_of(unordered_pair(esk2_0,esk2_0))) = unordered_pair(esk2_0,esk2_0),
inference(spm,[status(thm)],[50,46,theory(equality)]) ).
cnf(66,negated_conjecture,
unordered_pair(member_of(esk1_0),member_of(esk1_0)) = unordered_pair(esk2_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[63,47,theory(equality)]),47,theory(equality)]) ).
cnf(67,negated_conjecture,
unordered_pair(member_of(esk1_0),member_of(esk1_0)) = esk1_0,
inference(rw,[status(thm)],[66,47,theory(equality)]) ).
cnf(84,negated_conjecture,
member(esk2_0,unordered_pair(X1,esk2_0)),
inference(spm,[status(thm)],[61,46,theory(equality)]) ).
cnf(102,negated_conjecture,
( X1 = member_of(esk1_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[17,67,theory(equality)]) ).
cnf(108,negated_conjecture,
member(esk2_0,esk1_0),
inference(spm,[status(thm)],[84,47,theory(equality)]) ).
cnf(165,negated_conjecture,
esk2_0 = member_of(esk1_0),
inference(spm,[status(thm)],[102,108,theory(equality)]) ).
cnf(166,negated_conjecture,
$false,
inference(sr,[status(thm)],[165,44,theory(equality)]) ).
cnf(167,negated_conjecture,
$false,
166,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET090+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n189.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.5MB
% 0.03/0.24 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Sun Feb 24 09:56:28 CST 2019
% 0.03/0.25 % CPUTime :
% 0.03/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 --creating new selector for [SET005+0.ax]
% 29.07/29.41 eprover: CPU time limit exceeded, terminating
% 110.21/111.13 eprover: CPU time limit exceeded, terminating
% 110.30/111.38 -running prover on /export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_1 with time limit 29
% 110.30/111.38 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_1']
% 110.30/111.38 -prover status ResourceOut
% 110.30/111.38 -running prover on /export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_2 with time limit 81
% 110.30/111.38 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=81', '/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_2']
% 110.30/111.38 -prover status ResourceOut
% 110.30/111.38 --creating new selector for [SET005+0.ax]
% 185.38/186.56 eprover: CPU time limit exceeded, terminating
% 185.43/186.78 -running prover on /export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_3 with time limit 75
% 185.43/186.78 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=75', '/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_3']
% 185.43/186.78 -prover status ResourceOut
% 185.43/186.78 --creating new selector for [SET005+0.ax]
% 185.48/186.87 -running prover on /export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4 with time limit 56
% 185.48/186.87 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=56', '/export/starexec/sandbox2/tmp/tmpn1M9FS/sel_theBenchmark.p_4']
% 185.48/186.87 -prover status Theorem
% 185.48/186.87 Problem theBenchmark.p solved in phase 3.
% 185.48/186.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 185.48/186.87 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 185.48/186.87 Solved 1 out of 1.
% 185.48/186.87 # Problem is unsatisfiable (or provable), constructing proof object
% 185.48/186.87 # SZS status Theorem
% 185.48/186.87 # SZS output start CNFRefutation.
% See solution above
% 185.57/186.88 # SZS output end CNFRefutation
%------------------------------------------------------------------------------