TSTP Solution File: SET094+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET094+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n186.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:15 EST 2019
% Result : Theorem 185.55s
% Output : CNFRefutation 185.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 61 ( 8 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 61 ( 21 ~; 19 |; 18 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 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 : 27 ( 0 sgn 18 !; 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/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_4',unordered_pair_defn) ).
fof(3,axiom,
! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
file('/export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_4',singleton_set_defn) ).
fof(9,conjecture,
! [X2,X3] :
( ( equal(singleton(member_of(X2)),X2)
& member(X3,X2) )
=> equal(member_of(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_4',property_of_singletons1_1) ).
fof(11,negated_conjecture,
~ ! [X2,X3] :
( ( equal(singleton(member_of(X2)),X2)
& member(X3,X2) )
=> equal(member_of(X2),X3) ),
inference(assume_negation,[status(cth)],[9]) ).
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(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(39,negated_conjecture,
? [X2,X3] :
( equal(singleton(member_of(X2)),X2)
& member(X3,X2)
& ~ equal(member_of(X2),X3) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(40,negated_conjecture,
? [X4,X5] :
( equal(singleton(member_of(X4)),X4)
& member(X5,X4)
& ~ equal(member_of(X4),X5) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
( equal(singleton(member_of(esk1_0)),esk1_0)
& member(esk2_0,esk1_0)
& ~ equal(member_of(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
member_of(esk1_0) != esk2_0,
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
member(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,negated_conjecture,
singleton(member_of(esk1_0)) = esk1_0,
inference(split_conjunct,[status(thm)],[41]) ).
cnf(47,negated_conjecture,
unordered_pair(member_of(esk1_0),member_of(esk1_0)) = esk1_0,
inference(rw,[status(thm)],[44,22,theory(equality)]),
[unfolding] ).
cnf(65,negated_conjecture,
( X1 = member_of(esk1_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[17,47,theory(equality)]) ).
cnf(79,negated_conjecture,
esk2_0 = member_of(esk1_0),
inference(spm,[status(thm)],[65,43,theory(equality)]) ).
cnf(80,negated_conjecture,
$false,
inference(sr,[status(thm)],[79,42,theory(equality)]) ).
cnf(81,negated_conjecture,
$false,
80,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET094+1 : TPTP v7.3.0. Bugfixed v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.25 % Computer : n186.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.5MB
% 0.03/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Sun Feb 24 10:03:10 CST 2019
% 0.03/0.25 % CPUTime :
% 0.03/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30 --creating new selector for [SET005+0.ax]
% 29.09/29.43 eprover: CPU time limit exceeded, terminating
% 110.19/111.30 eprover: CPU time limit exceeded, terminating
% 110.31/111.51 -running prover on /export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_1 with time limit 29
% 110.31/111.51 -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/tmpKHSnDG/sel_theBenchmark.p_1']
% 110.31/111.51 -prover status ResourceOut
% 110.31/111.51 -running prover on /export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_2 with time limit 81
% 110.31/111.51 -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=81', '/export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_2']
% 110.31/111.51 -prover status ResourceOut
% 110.31/111.51 --creating new selector for [SET005+0.ax]
% 185.35/186.77 eprover: CPU time limit exceeded, terminating
% 185.48/194.49 -running prover on /export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_3 with time limit 75
% 185.48/194.49 -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=75', '/export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_3']
% 185.48/194.49 -prover status ResourceOut
% 185.48/194.49 --creating new selector for [SET005+0.ax]
% 185.55/206.24 -running prover on /export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_4 with time limit 52
% 185.55/206.24 -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=52', '/export/starexec/sandbox/tmp/tmpKHSnDG/sel_theBenchmark.p_4']
% 185.55/206.24 -prover status Theorem
% 185.55/206.24 Problem theBenchmark.p solved in phase 3.
% 185.55/206.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.55/206.24 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.58/206.27 Solved 1 out of 1.
% 185.58/206.27 # Problem is unsatisfiable (or provable), constructing proof object
% 185.58/206.27 # SZS status Theorem
% 185.58/206.27 # SZS output start CNFRefutation.
% See solution above
% 185.58/206.27 # SZS output end CNFRefutation
%------------------------------------------------------------------------------