TSTP Solution File: NUM633+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM633+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n041.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:22:04 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 124 ( 10 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 163 ( 65 ~; 53 |; 39 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,conjecture,
( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( ~ equal(X1,slcrc0)
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X1),szDzizrdt0(xd)) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> equal(sdtlpdtrp0(xc,X3),X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpauwWP2/sel_theBenchmark.p_1',m__) ).
fof(23,axiom,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/tmp/tmpauwWP2/sel_theBenchmark.p_1',m__4854) ).
fof(46,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/tmp/tmpauwWP2/sel_theBenchmark.p_1',m__4998) ).
fof(50,axiom,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/tmp/tmpauwWP2/sel_theBenchmark.p_1',m__4908) ).
fof(100,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( ~ equal(X1,slcrc0)
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X1),szDzizrdt0(xd)) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> equal(sdtlpdtrp0(xc,X3),X1) ) ) ) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(195,negated_conjecture,
( ! [X1] :
( ~ aElementOf0(X1,slbdtsldtrb0(xO,xK))
| ( ~ equal(X1,slcrc0)
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X1),szDzizrdt0(xd)) ) )
& ! [X1] :
( ~ aElementOf0(X1,xT)
| ! [X2] :
( ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ? [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
& ~ equal(sdtlpdtrp0(xc,X3),X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[100]) ).
fof(196,negated_conjecture,
( ! [X4] :
( ~ aElementOf0(X4,slbdtsldtrb0(xO,xK))
| ( ~ equal(X4,slcrc0)
& aSubsetOf0(X4,szNzAzT0)
& aElementOf0(X4,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X4),szDzizrdt0(xd)) ) )
& ! [X5] :
( ~ aElementOf0(X5,xT)
| ! [X6] :
( ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ? [X7] :
( aElementOf0(X7,slbdtsldtrb0(X6,xK))
& ~ equal(sdtlpdtrp0(xc,X7),X5) ) ) ) ),
inference(variable_rename,[status(thm)],[195]) ).
fof(197,negated_conjecture,
( ! [X4] :
( ~ aElementOf0(X4,slbdtsldtrb0(xO,xK))
| ( ~ equal(X4,slcrc0)
& aSubsetOf0(X4,szNzAzT0)
& aElementOf0(X4,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X4),szDzizrdt0(xd)) ) )
& ! [X5] :
( ~ aElementOf0(X5,xT)
| ! [X6] :
( ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ( aElementOf0(esk7_2(X5,X6),slbdtsldtrb0(X6,xK))
& ~ equal(sdtlpdtrp0(xc,esk7_2(X5,X6)),X5) ) ) ) ),
inference(skolemize,[status(esa)],[196]) ).
fof(198,negated_conjecture,
! [X4,X5,X6] :
( ( ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ( aElementOf0(esk7_2(X5,X6),slbdtsldtrb0(X6,xK))
& ~ equal(sdtlpdtrp0(xc,esk7_2(X5,X6)),X5) )
| ~ aElementOf0(X5,xT) )
& ( ~ aElementOf0(X4,slbdtsldtrb0(xO,xK))
| ( ~ equal(X4,slcrc0)
& aSubsetOf0(X4,szNzAzT0)
& aElementOf0(X4,szDzozmdt0(xc))
& equal(sdtlpdtrp0(xc,X4),szDzizrdt0(xd)) ) ) ),
inference(shift_quantors,[status(thm)],[197]) ).
fof(199,negated_conjecture,
! [X4,X5,X6] :
( ( aElementOf0(esk7_2(X5,X6),slbdtsldtrb0(X6,xK))
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( ~ equal(sdtlpdtrp0(xc,esk7_2(X5,X6)),X5)
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( ~ equal(X4,slcrc0)
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X4,szNzAzT0)
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X4,szDzozmdt0(xc))
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( equal(sdtlpdtrp0(xc,X4),szDzizrdt0(xd))
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) ) ),
inference(distribute,[status(thm)],[198]) ).
cnf(200,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
inference(split_conjunct,[status(thm)],[199]) ).
cnf(204,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk7_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[199]) ).
cnf(205,negated_conjecture,
( aElementOf0(esk7_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[199]) ).
cnf(221,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(325,plain,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[46]) ).
cnf(353,plain,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(746,negated_conjecture,
( sdtlpdtrp0(xc,esk7_2(X1,xO)) = szDzizrdt0(xd)
| ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[200,205,theory(equality)]) ).
cnf(759,negated_conjecture,
( sdtlpdtrp0(xc,esk7_2(X1,xO)) = szDzizrdt0(xd)
| $false
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[746,353,theory(equality)]) ).
cnf(760,negated_conjecture,
( sdtlpdtrp0(xc,esk7_2(X1,xO)) = szDzizrdt0(xd)
| $false
| $false
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[759,325,theory(equality)]) ).
cnf(761,negated_conjecture,
( sdtlpdtrp0(xc,esk7_2(X1,xO)) = szDzizrdt0(xd)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[760,theory(equality)]) ).
cnf(2283,negated_conjecture,
( szDzizrdt0(xd) != X1
| ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[204,761,theory(equality)]) ).
cnf(2289,negated_conjecture,
( szDzizrdt0(xd) != X1
| $false
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[2283,353,theory(equality)]) ).
cnf(2290,negated_conjecture,
( szDzizrdt0(xd) != X1
| $false
| $false
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[2289,325,theory(equality)]) ).
cnf(2291,negated_conjecture,
( szDzizrdt0(xd) != X1
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[2290,theory(equality)]) ).
cnf(2378,plain,
$false,
inference(spm,[status(thm)],[2291,221,theory(equality)]) ).
cnf(2388,plain,
$false,
2378,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM633+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n041.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 : Fri Jan 5 11:09:59 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.41 -running prover on /export/starexec/sandbox/tmp/tmpauwWP2/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.41 -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/tmpauwWP2/sel_theBenchmark.p_1']
% 0.06/0.41 -prover status Theorem
% 0.06/0.41 Problem theBenchmark.p solved in phase 0.
% 0.06/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.41 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.41 Solved 1 out of 1.
% 0.06/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.41 # SZS status Theorem
% 0.06/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------