TSTP Solution File: NUM455+6 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM455+6 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n064.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:24 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 128 ( 14 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 150 ( 48 ~; 47 |; 55 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,axiom,
( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xp,X1),sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
file('/export/starexec/sandbox/tmp/tmpsMJqHZ/sel_theBenchmark.p_1',m__2232) ).
fof(20,axiom,
( ~ equal(sdtpldt0(sz10,xp),sz10)
& ~ equal(sdtpldt0(sz10,smndt0(xp)),sz10) ),
file('/export/starexec/sandbox/tmp/tmpsMJqHZ/sel_theBenchmark.p_1',m__2258) ).
fof(28,axiom,
( ~ equal(sdtpldt0(sz10,xp),smndt0(sz10))
| ~ equal(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) ),
file('/export/starexec/sandbox/tmp/tmpsMJqHZ/sel_theBenchmark.p_1',m__2286) ).
fof(32,conjecture,
? [X1] :
( ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& equal(sdtasdt0(xp,X2),sdtpldt0(X1,smndt0(sz10))) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
| aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ~ ( ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) )
& aElementOf0(X1,cS2200) ) ),
file('/export/starexec/sandbox/tmp/tmpsMJqHZ/sel_theBenchmark.p_1',m__) ).
fof(51,negated_conjecture,
~ ? [X1] :
( ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& equal(sdtasdt0(xp,X2),sdtpldt0(X1,smndt0(sz10))) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
| aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ~ ( ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) )
& aElementOf0(X1,cS2200) ) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(194,plain,
( ? [X2] :
( aInteger0(X2)
& equal(sdtasdt0(xp,X2),sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(xp,X3),sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(195,plain,
( aInteger0(esk11_0)
& equal(sdtasdt0(xp,esk11_0),sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& aInteger0(esk12_0)
& equal(sdtasdt0(xp,esk12_0),sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(skolemize,[status(esa)],[194]) ).
cnf(196,plain,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(201,plain,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(206,plain,
sdtpldt0(sz10,smndt0(xp)) != sz10,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(207,plain,
sdtpldt0(sz10,xp) != sz10,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(282,plain,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(309,negated_conjecture,
! [X1] :
( ( ( ~ aInteger0(X1)
| ( ! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xp,X2),sdtpldt0(X1,smndt0(sz10))) )
& ~ aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& ~ sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
& ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
| ( ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) )
& aElementOf0(X1,cS2200) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(310,negated_conjecture,
! [X3] :
( ( ( ~ aInteger0(X3)
| ( ! [X4] :
( ~ aInteger0(X4)
| ~ equal(sdtasdt0(xp,X4),sdtpldt0(X3,smndt0(sz10))) )
& ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
& ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp) ) )
& ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
| ( ( equal(X3,sz10)
| equal(X3,smndt0(sz10)) )
& aElementOf0(X3,cS2200) ) ),
inference(variable_rename,[status(thm)],[309]) ).
fof(311,negated_conjecture,
! [X3,X4] :
( ( ( ( ( ~ aInteger0(X4)
| ~ equal(sdtasdt0(xp,X4),sdtpldt0(X3,smndt0(sz10))) )
& ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
& ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp) )
| ~ aInteger0(X3) )
& ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
| ( ( equal(X3,sz10)
| equal(X3,smndt0(sz10)) )
& aElementOf0(X3,cS2200) ) ),
inference(shift_quantors,[status(thm)],[310]) ).
fof(312,negated_conjecture,
! [X3,X4] :
( ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ aInteger0(X4)
| ~ equal(sdtasdt0(xp,X4),sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ aInteger0(X4)
| ~ equal(sdtasdt0(xp,X4),sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aElementOf0(X3,cS2200)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) ),
inference(distribute,[status(thm)],[311]) ).
cnf(314,negated_conjecture,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(split_conjunct,[status(thm)],[312]) ).
cnf(593,plain,
( smndt0(sz10) = sdtpldt0(sz10,xp)
| sz10 = sdtpldt0(sz10,xp) ),
inference(spm,[status(thm)],[314,201,theory(equality)]) ).
cnf(594,plain,
( smndt0(sz10) = sdtpldt0(sz10,smndt0(xp))
| sz10 = sdtpldt0(sz10,smndt0(xp)) ),
inference(spm,[status(thm)],[314,196,theory(equality)]) ).
cnf(596,plain,
sdtpldt0(sz10,xp) = smndt0(sz10),
inference(sr,[status(thm)],[593,207,theory(equality)]) ).
cnf(597,plain,
sdtpldt0(sz10,smndt0(xp)) = smndt0(sz10),
inference(sr,[status(thm)],[594,206,theory(equality)]) ).
cnf(2322,plain,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| $false ),
inference(rw,[status(thm)],[282,596,theory(equality)]) ).
cnf(2323,plain,
sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10),
inference(cn,[status(thm)],[2322,theory(equality)]) ).
cnf(2485,plain,
$false,
inference(rw,[status(thm)],[2323,597,theory(equality)]) ).
cnf(2486,plain,
$false,
inference(cn,[status(thm)],[2485,theory(equality)]) ).
cnf(2487,plain,
$false,
2486,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM455+6 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n064.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 04:28:15 CST 2018
% 0.03/0.23 % 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.41 -running prover on /export/starexec/sandbox/tmp/tmpsMJqHZ/sel_theBenchmark.p_1 with time limit 29
% 0.07/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/tmpsMJqHZ/sel_theBenchmark.p_1']
% 0.07/0.41 -prover status Theorem
% 0.07/0.41 Problem theBenchmark.p solved in phase 0.
% 0.07/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.41 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.41 Solved 1 out of 1.
% 0.07/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.41 # SZS status Theorem
% 0.07/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------