TSTP Solution File: NUM414+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM414+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n136.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:16 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 148 ( 4 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 174 ( 68 ~; 66 |; 30 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpdjdUmf/sel_theBenchmark.p_1',connectedness_r1_ordinal1) ).
fof(9,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ proper_subset(X1,X2)
& ~ equal(X1,X2)
& ~ proper_subset(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmpdjdUmf/sel_theBenchmark.p_1',t50_ordinal1) ).
fof(24,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpdjdUmf/sel_theBenchmark.p_1',redefinition_r1_ordinal1) ).
fof(28,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& ~ equal(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpdjdUmf/sel_theBenchmark.p_1',d8_xboole_0) ).
fof(43,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ proper_subset(X1,X2)
& ~ equal(X1,X2)
& ~ proper_subset(X2,X1) ) ) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(46,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ proper_subset(X1,X2)
& ~ equal(X1,X2)
& ~ proper_subset(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[43,theory(equality)]) ).
fof(72,plain,
! [X1,X2] :
( ~ ordinal(X1)
| ~ ordinal(X2)
| ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(73,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ordinal_subset(X3,X4)
| ordinal_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[72]) ).
cnf(74,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[73]) ).
fof(78,negated_conjecture,
? [X1] :
( ordinal(X1)
& ? [X2] :
( ordinal(X2)
& ~ proper_subset(X1,X2)
& ~ equal(X1,X2)
& ~ proper_subset(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(79,negated_conjecture,
? [X3] :
( ordinal(X3)
& ? [X4] :
( ordinal(X4)
& ~ proper_subset(X3,X4)
& ~ equal(X3,X4)
& ~ proper_subset(X4,X3) ) ),
inference(variable_rename,[status(thm)],[78]) ).
fof(80,negated_conjecture,
( ordinal(esk4_0)
& ordinal(esk5_0)
& ~ proper_subset(esk4_0,esk5_0)
& ~ equal(esk4_0,esk5_0)
& ~ proper_subset(esk5_0,esk4_0) ),
inference(skolemize,[status(esa)],[79]) ).
cnf(81,negated_conjecture,
~ proper_subset(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(82,negated_conjecture,
esk4_0 != esk5_0,
inference(split_conjunct,[status(thm)],[80]) ).
cnf(83,negated_conjecture,
~ proper_subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(84,negated_conjecture,
ordinal(esk5_0),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(85,negated_conjecture,
ordinal(esk4_0),
inference(split_conjunct,[status(thm)],[80]) ).
fof(140,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)],[24]) ).
fof(141,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)],[140]) ).
fof(142,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)],[141]) ).
cnf(144,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[142]) ).
fof(158,plain,
! [X1,X2] :
( ( ~ proper_subset(X1,X2)
| ( subset(X1,X2)
& ~ equal(X1,X2) ) )
& ( ~ subset(X1,X2)
| equal(X1,X2)
| proper_subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(159,plain,
! [X3,X4] :
( ( ~ proper_subset(X3,X4)
| ( subset(X3,X4)
& ~ equal(X3,X4) ) )
& ( ~ subset(X3,X4)
| equal(X3,X4)
| proper_subset(X3,X4) ) ),
inference(variable_rename,[status(thm)],[158]) ).
fof(160,plain,
! [X3,X4] :
( ( subset(X3,X4)
| ~ proper_subset(X3,X4) )
& ( ~ equal(X3,X4)
| ~ proper_subset(X3,X4) )
& ( ~ subset(X3,X4)
| equal(X3,X4)
| proper_subset(X3,X4) ) ),
inference(distribute,[status(thm)],[159]) ).
cnf(161,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[160]) ).
cnf(267,negated_conjecture,
( ordinal_subset(X1,esk4_0)
| ordinal_subset(esk4_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[74,85,theory(equality)]) ).
cnf(320,negated_conjecture,
( ordinal_subset(esk4_0,esk5_0)
| ordinal_subset(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[267,84,theory(equality)]) ).
cnf(329,negated_conjecture,
( subset(esk5_0,esk4_0)
| ordinal_subset(esk4_0,esk5_0)
| ~ ordinal(esk5_0)
| ~ ordinal(esk4_0) ),
inference(spm,[status(thm)],[144,320,theory(equality)]) ).
cnf(330,negated_conjecture,
( subset(esk5_0,esk4_0)
| ordinal_subset(esk4_0,esk5_0)
| $false
| ~ ordinal(esk4_0) ),
inference(rw,[status(thm)],[329,84,theory(equality)]) ).
cnf(331,negated_conjecture,
( subset(esk5_0,esk4_0)
| ordinal_subset(esk4_0,esk5_0)
| $false
| $false ),
inference(rw,[status(thm)],[330,85,theory(equality)]) ).
cnf(332,negated_conjecture,
( subset(esk5_0,esk4_0)
| ordinal_subset(esk4_0,esk5_0) ),
inference(cn,[status(thm)],[331,theory(equality)]) ).
cnf(347,negated_conjecture,
( subset(esk4_0,esk5_0)
| subset(esk5_0,esk4_0)
| ~ ordinal(esk4_0)
| ~ ordinal(esk5_0) ),
inference(spm,[status(thm)],[144,332,theory(equality)]) ).
cnf(348,negated_conjecture,
( subset(esk4_0,esk5_0)
| subset(esk5_0,esk4_0)
| $false
| ~ ordinal(esk5_0) ),
inference(rw,[status(thm)],[347,85,theory(equality)]) ).
cnf(349,negated_conjecture,
( subset(esk4_0,esk5_0)
| subset(esk5_0,esk4_0)
| $false
| $false ),
inference(rw,[status(thm)],[348,84,theory(equality)]) ).
cnf(350,negated_conjecture,
( subset(esk4_0,esk5_0)
| subset(esk5_0,esk4_0) ),
inference(cn,[status(thm)],[349,theory(equality)]) ).
cnf(380,negated_conjecture,
( esk5_0 = esk4_0
| proper_subset(esk5_0,esk4_0)
| subset(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[161,350,theory(equality)]) ).
cnf(382,negated_conjecture,
( proper_subset(esk5_0,esk4_0)
| subset(esk4_0,esk5_0) ),
inference(sr,[status(thm)],[380,82,theory(equality)]) ).
cnf(383,negated_conjecture,
subset(esk4_0,esk5_0),
inference(sr,[status(thm)],[382,81,theory(equality)]) ).
cnf(384,negated_conjecture,
( esk4_0 = esk5_0
| proper_subset(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[161,383,theory(equality)]) ).
cnf(387,negated_conjecture,
proper_subset(esk4_0,esk5_0),
inference(sr,[status(thm)],[384,82,theory(equality)]) ).
cnf(388,negated_conjecture,
$false,
inference(sr,[status(thm)],[387,83,theory(equality)]) ).
cnf(389,negated_conjecture,
$false,
388,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM414+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 : n136.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:53:15 CST 2018
% 0.03/0.24 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.07/0.36 -running prover on /export/starexec/sandbox/tmp/tmpdjdUmf/sel_theBenchmark.p_1 with time limit 29
% 0.07/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/tmpdjdUmf/sel_theBenchmark.p_1']
% 0.07/0.36 -prover status Theorem
% 0.07/0.36 Problem theBenchmark.p solved in phase 0.
% 0.07/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 Solved 1 out of 1.
% 0.07/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36 # SZS status Theorem
% 0.07/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------