TSTP Solution File: NUM436+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n023.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 : Tue Aug 22 10:51:40 EDT 2023
% Result : Theorem 5.31s 2.23s
% Output : CNFRefutation 5.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 37 ( 10 unt; 15 typ; 0 def)
% Number of atoms : 50 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 51 ( 23 ~; 16 |; 11 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 12 (; 10 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aDivisorOf0 > aInteger0 > sdtpldt0 > sdtasdt0 > #nlpp > smndt0 > xq > xp > xm > xb > xa > sz10 > sz00 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aInteger0,type,
aInteger0: $i > $o ).
tff(xq,type,
xq: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(xa,type,
xa: $i ).
tff(sz10,type,
sz10: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(xb,type,
xb: $i ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(xp,type,
xp: $i ).
tff(xm,type,
xm: $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_205,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& ( xp != sz00 )
& aInteger0(xq)
& ( xq != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).
tff(f_219,hypothesis,
( aInteger0(xm)
& ( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1032) ).
tff(f_47,axiom,
! [W0,W1] :
( ( aInteger0(W0)
& aInteger0(W1) )
=> aInteger0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
tff(f_222,hypothesis,
( ( sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)) )
& ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1071) ).
tff(f_240,negated_conjecture,
~ ( ( ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xp,W0) = sdtpldt0(xa,smndt0(xb)) ) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb)) ) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_70,plain,
aInteger0(xq),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_92,plain,
aInteger0(xm),
inference(cnfTransformation,[status(thm)],[f_219]) ).
tff(c_12,plain,
! [W0_5,W1_6] :
( aInteger0(sdtasdt0(W0_5,W1_6))
| ~ aInteger0(W1_6)
| ~ aInteger0(W0_5) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_74,plain,
aInteger0(xp),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_96,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_94,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_123,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(demodulation,[status(thm),theory(equality)],[c_96,c_94]) ).
tff(c_114,plain,
! [W0_49,W0_50] :
( ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,W0_49) )
| ~ aInteger0(W0_49)
| ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,W0_50) )
| ~ aInteger0(W0_50) ),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_121,plain,
! [W0_49,W0_50] :
( ( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,W0_49) )
| ~ aInteger0(W0_49)
| ( sdtasdt0(xq,W0_50) != sdtasdt0(xp,sdtasdt0(xq,xm)) )
| ~ aInteger0(W0_50) ),
inference(demodulation,[status(thm),theory(equality)],[c_96,c_96,c_114]) ).
tff(c_975,plain,
! [W0_50] :
( ( sdtasdt0(xq,W0_50) != sdtasdt0(xp,sdtasdt0(xq,xm)) )
| ~ aInteger0(W0_50) ),
inference(splitLeft,[status(thm)],[c_121]) ).
tff(c_1774,plain,
~ aInteger0(sdtasdt0(xp,xm)),
inference(superposition,[status(thm),theory(equality)],[c_123,c_975]) ).
tff(c_1780,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xp) ),
inference(resolution,[status(thm)],[c_12,c_1774]) ).
tff(c_1784,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_74,c_92,c_1780]) ).
tff(c_1785,plain,
! [W0_49] :
( ( sdtasdt0(xp,sdtasdt0(xq,xm)) != sdtasdt0(xp,W0_49) )
| ~ aInteger0(W0_49) ),
inference(splitRight,[status(thm)],[c_121]) ).
tff(c_1852,plain,
~ aInteger0(sdtasdt0(xq,xm)),
inference(reflexivity,[status(thm),theory(equality)],[c_1785]) ).
tff(c_1856,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xq) ),
inference(resolution,[status(thm)],[c_12,c_1852]) ).
tff(c_1860,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_70,c_92,c_1856]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 14:46:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 5.31/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.31/2.24
% 5.31/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.31/2.26
% 5.31/2.26 Inference rules
% 5.31/2.26 ----------------------
% 5.31/2.26 #Ref : 1
% 5.31/2.26 #Sup : 443
% 5.31/2.26 #Fact : 0
% 5.31/2.26 #Define : 0
% 5.31/2.26 #Split : 9
% 5.31/2.26 #Chain : 0
% 5.31/2.26 #Close : 0
% 5.31/2.26
% 5.31/2.26 Ordering : KBO
% 5.31/2.26
% 5.31/2.26 Simplification rules
% 5.31/2.26 ----------------------
% 5.31/2.26 #Subsume : 12
% 5.31/2.26 #Demod : 316
% 5.31/2.26 #Tautology : 269
% 5.31/2.26 #SimpNegUnit : 0
% 5.31/2.26 #BackRed : 0
% 5.31/2.26
% 5.31/2.26 #Partial instantiations: 0
% 5.31/2.26 #Strategies tried : 1
% 5.31/2.26
% 5.31/2.26 Timing (in seconds)
% 5.31/2.26 ----------------------
% 5.31/2.26 Preprocessing : 0.60
% 5.31/2.26 Parsing : 0.31
% 5.31/2.26 CNF conversion : 0.04
% 5.31/2.26 Main loop : 0.62
% 5.31/2.26 Inferencing : 0.20
% 5.31/2.26 Reduction : 0.21
% 5.31/2.26 Demodulation : 0.16
% 5.31/2.27 BG Simplification : 0.04
% 5.31/2.27 Subsumption : 0.12
% 5.31/2.27 Abstraction : 0.02
% 5.31/2.27 MUC search : 0.00
% 5.31/2.27 Cooper : 0.00
% 5.31/2.27 Total : 1.26
% 5.31/2.27 Index Insertion : 0.00
% 5.31/2.27 Index Deletion : 0.00
% 5.31/2.27 Index Matching : 0.00
% 5.31/2.27 BG Taut test : 0.00
%------------------------------------------------------------------------------