TSTP Solution File: NUM425+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM425+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 10:37:19 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 44 ( 10 unt; 12 typ; 0 def)
% Number of atoms : 99 ( 20 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 115 ( 48 ~; 44 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn; 19 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aInteger0: $i > $o ).
tff(decl_23,type,
sz00: $i ).
tff(decl_24,type,
sz10: $i ).
tff(decl_25,type,
smndt0: $i > $i ).
tff(decl_26,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_27,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(decl_28,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(decl_29,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff(decl_30,type,
xa: $i ).
tff(decl_31,type,
xb: $i ).
tff(decl_32,type,
xq: $i ).
tff(decl_33,type,
esk1_2: ( $i * $i ) > $i ).
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
fof(m__724,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__724) ).
fof(m__704,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__704) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(m__,conjecture,
? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(c_0_7,plain,
! [X34,X35,X36] :
( ( ~ sdteqdtlpzmzozddtrp0(X34,X35,X36)
| aDivisorOf0(X36,sdtpldt0(X34,smndt0(X35)))
| ~ aInteger0(X34)
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| X36 = sz00 )
& ( ~ aDivisorOf0(X36,sdtpldt0(X34,smndt0(X35)))
| sdteqdtlpzmzozddtrp0(X34,X35,X36)
| ~ aInteger0(X34)
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| X36 = sz00 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquMod])])]) ).
fof(c_0_8,plain,
! [X29,X30,X32,X33] :
( ( aInteger0(X30)
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( X30 != sz00
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( aInteger0(esk1_2(X29,X30))
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( sdtasdt0(X30,esk1_2(X29,X30)) = X29
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( ~ aInteger0(X32)
| X32 = sz00
| ~ aInteger0(X33)
| sdtasdt0(X32,X33) != X29
| aDivisorOf0(X32,X29)
| ~ aInteger0(X29) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivisor])])])])])]) ).
cnf(c_0_9,plain,
( aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2)))
| X3 = sz00
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(split_conjunct,[status(thm)],[m__724]) ).
cnf(c_0_11,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_12,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_13,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_14,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_15,plain,
( sdtasdt0(X1,esk1_2(X2,X1)) = X2
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
fof(c_0_17,plain,
! [X5,X6] :
( ~ aInteger0(X5)
| ~ aInteger0(X6)
| aInteger0(sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])]) ).
cnf(c_0_18,plain,
( aInteger0(esk1_2(X1,X2))
| ~ aDivisorOf0(X2,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,negated_conjecture,
~ ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_20,hypothesis,
( sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X4] :
( ~ aInteger0(X4)
| aInteger0(smndt0(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_23,hypothesis,
( aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))
| ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
fof(c_0_24,negated_conjecture,
! [X39] :
( ~ aInteger0(X39)
| sdtasdt0(xq,X39) != sdtpldt0(xa,smndt0(xb)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_25,hypothesis,
( sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13])]) ).
cnf(c_0_26,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
( aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))
| ~ aInteger0(smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12])]) ).
cnf(c_0_30,hypothesis,
aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_12])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM425+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 13:12:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.013000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.016000 s
%------------------------------------------------------------------------------