TSTP Solution File: NUM393+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM393+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n131.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.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 132 ( 48 ~; 59 |; 17 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpEwFsaC/sel_theBenchmark.p_1',connectedness_r1_ordinal1) ).
fof(10,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpEwFsaC/sel_theBenchmark.p_1',t25_ordinal1) ).
fof(22,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpEwFsaC/sel_theBenchmark.p_1',redefinition_r1_ordinal1) ).
fof(24,axiom,
! [X1,X2] :
( inclusion_comparable(X1,X2)
<=> ( subset(X1,X2)
| subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpEwFsaC/sel_theBenchmark.p_1',d9_xboole_0) ).
fof(38,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(59,plain,
! [X1,X2] :
( ~ ordinal(X1)
| ~ ordinal(X2)
| ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(60,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ordinal_subset(X3,X4)
| ordinal_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[59]) ).
cnf(61,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(72,negated_conjecture,
? [X1] :
( ordinal(X1)
& ? [X2] :
( ordinal(X2)
& ~ inclusion_comparable(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(73,negated_conjecture,
? [X3] :
( ordinal(X3)
& ? [X4] :
( ordinal(X4)
& ~ inclusion_comparable(X3,X4) ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,negated_conjecture,
( ordinal(esk5_0)
& ordinal(esk6_0)
& ~ inclusion_comparable(esk5_0,esk6_0) ),
inference(skolemize,[status(esa)],[73]) ).
cnf(75,negated_conjecture,
~ inclusion_comparable(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(76,negated_conjecture,
ordinal(esk6_0),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(77,negated_conjecture,
ordinal(esk5_0),
inference(split_conjunct,[status(thm)],[74]) ).
fof(120,plain,
! [X1,X2] :
( ~ ordinal(X1)
| ~ ordinal(X2)
| ( ( ~ ordinal_subset(X1,X2)
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| ordinal_subset(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(121,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4) ) ) ),
inference(variable_rename,[status(thm)],[120]) ).
fof(122,plain,
! [X3,X4] :
( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) ) ),
inference(distribute,[status(thm)],[121]) ).
cnf(124,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[122]) ).
fof(128,plain,
! [X1,X2] :
( ( ~ inclusion_comparable(X1,X2)
| subset(X1,X2)
| subset(X2,X1) )
& ( ( ~ subset(X1,X2)
& ~ subset(X2,X1) )
| inclusion_comparable(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(129,plain,
! [X3,X4] :
( ( ~ inclusion_comparable(X3,X4)
| subset(X3,X4)
| subset(X4,X3) )
& ( ( ~ subset(X3,X4)
& ~ subset(X4,X3) )
| inclusion_comparable(X3,X4) ) ),
inference(variable_rename,[status(thm)],[128]) ).
fof(130,plain,
! [X3,X4] :
( ( ~ inclusion_comparable(X3,X4)
| subset(X3,X4)
| subset(X4,X3) )
& ( ~ subset(X3,X4)
| inclusion_comparable(X3,X4) )
& ( ~ subset(X4,X3)
| inclusion_comparable(X3,X4) ) ),
inference(distribute,[status(thm)],[129]) ).
cnf(131,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(132,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(188,negated_conjecture,
~ subset(esk6_0,esk5_0),
inference(spm,[status(thm)],[75,131,theory(equality)]) ).
cnf(190,negated_conjecture,
~ subset(esk5_0,esk6_0),
inference(spm,[status(thm)],[75,132,theory(equality)]) ).
cnf(208,negated_conjecture,
( ordinal_subset(X1,esk5_0)
| ordinal_subset(esk5_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[61,77,theory(equality)]) ).
cnf(239,negated_conjecture,
( ordinal_subset(esk5_0,esk6_0)
| ordinal_subset(esk6_0,esk5_0) ),
inference(spm,[status(thm)],[208,76,theory(equality)]) ).
cnf(256,negated_conjecture,
( subset(esk6_0,esk5_0)
| ordinal_subset(esk5_0,esk6_0)
| ~ ordinal(esk6_0)
| ~ ordinal(esk5_0) ),
inference(spm,[status(thm)],[124,239,theory(equality)]) ).
cnf(257,negated_conjecture,
( subset(esk6_0,esk5_0)
| ordinal_subset(esk5_0,esk6_0)
| $false
| ~ ordinal(esk5_0) ),
inference(rw,[status(thm)],[256,76,theory(equality)]) ).
cnf(258,negated_conjecture,
( subset(esk6_0,esk5_0)
| ordinal_subset(esk5_0,esk6_0)
| $false
| $false ),
inference(rw,[status(thm)],[257,77,theory(equality)]) ).
cnf(259,negated_conjecture,
( subset(esk6_0,esk5_0)
| ordinal_subset(esk5_0,esk6_0) ),
inference(cn,[status(thm)],[258,theory(equality)]) ).
cnf(260,negated_conjecture,
ordinal_subset(esk5_0,esk6_0),
inference(sr,[status(thm)],[259,188,theory(equality)]) ).
cnf(261,negated_conjecture,
( subset(esk5_0,esk6_0)
| ~ ordinal(esk5_0)
| ~ ordinal(esk6_0) ),
inference(spm,[status(thm)],[124,260,theory(equality)]) ).
cnf(263,negated_conjecture,
( subset(esk5_0,esk6_0)
| $false
| ~ ordinal(esk6_0) ),
inference(rw,[status(thm)],[261,77,theory(equality)]) ).
cnf(264,negated_conjecture,
( subset(esk5_0,esk6_0)
| $false
| $false ),
inference(rw,[status(thm)],[263,76,theory(equality)]) ).
cnf(265,negated_conjecture,
subset(esk5_0,esk6_0),
inference(cn,[status(thm)],[264,theory(equality)]) ).
cnf(266,negated_conjecture,
$false,
inference(sr,[status(thm)],[265,190,theory(equality)]) ).
cnf(267,negated_conjecture,
$false,
266,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM393+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.23 % Computer : n131.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 02:37:45 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.07/0.35 -running prover on /export/starexec/sandbox2/tmp/tmpEwFsaC/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.35 -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/tmpEwFsaC/sel_theBenchmark.p_1']
% 0.07/0.35 -prover status Theorem
% 0.07/0.35 Problem theBenchmark.p solved in phase 0.
% 0.07/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 Solved 1 out of 1.
% 0.07/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.35 # SZS status Theorem
% 0.07/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------