TSTP Solution File: NUM387+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM387+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n075.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:14 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 19 unt; 0 def)
% Number of atoms : 29 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 13 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/tmp/tmp8EmMRL/sel_theBenchmark.p_1',t10_ordinal1) ).
fof(14,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp8EmMRL/sel_theBenchmark.p_1',antisymmetry_r2_hidden) ).
fof(18,axiom,
! [X1] : equal(succ(X1),set_union2(X1,singleton(X1))),
file('/export/starexec/sandbox2/tmp/tmp8EmMRL/sel_theBenchmark.p_1',d1_ordinal1) ).
fof(28,conjecture,
! [X1] : ~ equal(X1,succ(X1)),
file('/export/starexec/sandbox2/tmp/tmp8EmMRL/sel_theBenchmark.p_1',t14_ordinal1) ).
fof(34,negated_conjecture,
~ ! [X1] : ~ equal(X1,succ(X1)),
inference(assume_negation,[status(cth)],[28]) ).
fof(37,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(48,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(49,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[48]) ).
fof(80,plain,
! [X1,X2] :
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(81,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(82,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(96,plain,
! [X2] : equal(succ(X2),set_union2(X2,singleton(X2))),
inference(variable_rename,[status(thm)],[18]) ).
cnf(97,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[96]) ).
fof(122,negated_conjecture,
? [X1] : equal(X1,succ(X1)),
inference(fof_nnf,[status(thm)],[34]) ).
fof(123,negated_conjecture,
? [X2] : equal(X2,succ(X2)),
inference(variable_rename,[status(thm)],[122]) ).
fof(124,negated_conjecture,
equal(esk8_0,succ(esk8_0)),
inference(skolemize,[status(esa)],[123]) ).
cnf(125,negated_conjecture,
esk8_0 = succ(esk8_0),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(147,negated_conjecture,
set_union2(esk8_0,singleton(esk8_0)) = esk8_0,
inference(rw,[status(thm)],[125,97,theory(equality)]),
[unfolding] ).
cnf(148,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[49,97,theory(equality)]),
[unfolding] ).
cnf(163,negated_conjecture,
in(esk8_0,esk8_0),
inference(spm,[status(thm)],[148,147,theory(equality)]) ).
cnf(180,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[82,148,theory(equality)]) ).
cnf(215,negated_conjecture,
~ in(esk8_0,esk8_0),
inference(spm,[status(thm)],[180,147,theory(equality)]) ).
cnf(218,negated_conjecture,
$false,
inference(sr,[status(thm)],[163,215,theory(equality)]) ).
cnf(219,negated_conjecture,
$false,
218,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM387+1 : TPTP v7.0.0. Released v3.2.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n075.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Mon Jan 8 08:10:42 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.44 -running prover on /export/starexec/sandbox2/tmp/tmp8EmMRL/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.44 -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/tmp8EmMRL/sel_theBenchmark.p_1']
% 0.06/0.44 -prover status Theorem
% 0.06/0.44 Problem theBenchmark.p solved in phase 0.
% 0.06/0.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.44 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.44 Solved 1 out of 1.
% 0.06/0.44 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.44 # SZS status Theorem
% 0.06/0.44 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.44 # SZS output end CNFRefutation
%------------------------------------------------------------------------------