TSTP Solution File: NUM383+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM383+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n042.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:13 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 98 ( 47 ~; 36 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 68 ( 3 sgn 42 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',t5_subset) ).
fof(8,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',t4_subset) ).
fof(13,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',antisymmetry_r2_hidden) ).
fof(17,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',t2_subset) ).
fof(18,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',t3_subset) ).
fof(28,conjecture,
! [X1,X2] :
~ ( in(X1,X2)
& subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1',t7_ordinal1) ).
fof(29,negated_conjecture,
~ ! [X1,X2] :
~ ( in(X1,X2)
& subset(X2,X1) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(31,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(37,plain,
! [X1,X2,X3] :
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(38,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(variable_rename,[status(thm)],[37]) ).
cnf(39,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(57,plain,
! [X1,X2,X3] :
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| element(X1,X3) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(58,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(73,plain,
! [X1,X2] :
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(74,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(91,plain,
! [X1,X2] :
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(92,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[91]) ).
cnf(93,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[92]) ).
fof(94,plain,
! [X1,X2] :
( ( ~ element(X1,powerset(X2))
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| element(X1,powerset(X2)) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(95,plain,
! [X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(variable_rename,[status(thm)],[94]) ).
cnf(96,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(126,negated_conjecture,
? [X1,X2] :
( in(X1,X2)
& subset(X2,X1) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(127,negated_conjecture,
? [X3,X4] :
( in(X3,X4)
& subset(X4,X3) ),
inference(variable_rename,[status(thm)],[126]) ).
fof(128,negated_conjecture,
( in(esk12_0,esk13_0)
& subset(esk13_0,esk12_0) ),
inference(skolemize,[status(esa)],[127]) ).
cnf(129,negated_conjecture,
subset(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(130,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[128]) ).
cnf(153,plain,
( ~ empty(X1)
| ~ in(X3,X2)
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[39,96,theory(equality)]) ).
cnf(156,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(spm,[status(thm)],[59,96,theory(equality)]) ).
cnf(157,negated_conjecture,
( ~ empty(esk12_0)
| ~ in(X1,esk13_0) ),
inference(spm,[status(thm)],[153,129,theory(equality)]) ).
cnf(159,negated_conjecture,
~ empty(esk12_0),
inference(spm,[status(thm)],[157,130,theory(equality)]) ).
cnf(223,negated_conjecture,
( element(X1,esk12_0)
| ~ in(X1,esk13_0) ),
inference(spm,[status(thm)],[156,129,theory(equality)]) ).
cnf(227,negated_conjecture,
( empty(esk12_0)
| in(X1,esk12_0)
| ~ in(X1,esk13_0) ),
inference(spm,[status(thm)],[93,223,theory(equality)]) ).
cnf(228,negated_conjecture,
( in(X1,esk12_0)
| ~ in(X1,esk13_0) ),
inference(sr,[status(thm)],[227,159,theory(equality)]) ).
cnf(230,negated_conjecture,
in(esk12_0,esk12_0),
inference(spm,[status(thm)],[228,130,theory(equality)]) ).
cnf(233,negated_conjecture,
~ in(esk12_0,esk12_0),
inference(spm,[status(thm)],[75,230,theory(equality)]) ).
cnf(235,negated_conjecture,
$false,
inference(rw,[status(thm)],[233,230,theory(equality)]) ).
cnf(236,negated_conjecture,
$false,
inference(cn,[status(thm)],[235,theory(equality)]) ).
cnf(237,negated_conjecture,
$false,
236,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM383+1 : TPTP v7.0.0. Released v3.2.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n042.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.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 02:37:15 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.29 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29 --creating new selector for []
% 0.06/0.36 -running prover on /export/starexec/sandbox/tmp/tmpmHcKTf/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.36 -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/tmpmHcKTf/sel_theBenchmark.p_1']
% 0.06/0.36 -prover status Theorem
% 0.06/0.36 Problem theBenchmark.p solved in phase 0.
% 0.06/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.36 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.36 Solved 1 out of 1.
% 0.06/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.36 # SZS status Theorem
% 0.06/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------