TSTP Solution File: LAT381+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT381+1 : 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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n007.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:47:05 EDT 2023
% Result : Theorem 4.25s 2.18s
% Output : CNFRefutation 4.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 27
% Syntax : Number of formulae : 56 ( 16 unt; 20 typ; 1 def)
% Number of atoms : 87 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 92 ( 41 ~; 38 |; 5 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 16 >; 20 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aUpperBoundOfIn0 > aSupremumOfIn0 > aLowerBoundOfIn0 > aInfimumOfIn0 > sdtlseqdt0 > aSubsetOf0 > aElementOf0 > isEmpty0 > aSet0 > aElement0 > #nlpp > xv > xu > xT > xS > #skF_6 > #skF_1 > #skF_4 > #skF_5 > #skF_3 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(aUpperBoundOfIn0,type,
aUpperBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(xu,type,
xu: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(aLowerBoundOfIn0,type,
aLowerBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(xT,type,
xT: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(aInfimumOfIn0,type,
aInfimumOfIn0: ( $i * $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(isEmpty0,type,
isEmpty0: $i > $o ).
tff(aSupremumOfIn0,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff(xv,type,
xv: $i ).
tff(f_164,negated_conjecture,
xu != xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_158,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725) ).
tff(f_159,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725_01) ).
tff(f_162,hypothesis,
( aSupremumOfIn0(xu,xS,xT)
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
tff(f_157,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aUpperBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aUpperBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W2,W3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSup) ).
tff(f_40,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_81,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> ( ( sdtlseqdt0(W0,W1)
& sdtlseqdt0(W1,W0) )
=> ( W0 = W1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
tff(c_72,plain,
xv != xu,
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_64,plain,
aSet0(xT),
inference(cnfTransformation,[status(thm)],[f_158]) ).
tff(c_66,plain,
aSubsetOf0(xS,xT),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_70,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_98,plain,
! [W2_131,W0_132,W1_133] :
( aElementOf0(W2_131,W0_132)
| ~ aSupremumOfIn0(W2_131,W1_133,W0_132)
| ~ aSubsetOf0(W1_133,W0_132)
| ~ aSet0(W0_132) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_104,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_70,c_98]) ).
tff(c_110,plain,
aElementOf0(xu,xT),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_66,c_104]) ).
tff(c_6,plain,
! [W1_5,W0_3] :
( aElement0(W1_5)
| ~ aElementOf0(W1_5,W0_3)
| ~ aSet0(W0_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_148,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_110,c_6]) ).
tff(c_155,plain,
aElement0(xu),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_148]) ).
tff(c_68,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_101,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_68,c_98]) ).
tff(c_107,plain,
aElementOf0(xv,xT),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_66,c_101]) ).
tff(c_116,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_107,c_6]) ).
tff(c_123,plain,
aElement0(xv),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_116]) ).
tff(c_56,plain,
! [W2_112,W1_106,W0_94] :
( aUpperBoundOfIn0(W2_112,W1_106,W0_94)
| ~ aSupremumOfIn0(W2_112,W1_106,W0_94)
| ~ aSubsetOf0(W1_106,W0_94)
| ~ aSet0(W0_94) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_312,plain,
! [W2_194,W3_195,W1_196,W0_197] :
( sdtlseqdt0(W2_194,W3_195)
| ~ aUpperBoundOfIn0(W3_195,W1_196,W0_197)
| ~ aSupremumOfIn0(W2_194,W1_196,W0_197)
| ~ aSubsetOf0(W1_196,W0_197)
| ~ aSet0(W0_197) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_317,plain,
! [W2_202,W2_203,W1_204,W0_205] :
( sdtlseqdt0(W2_202,W2_203)
| ~ aSupremumOfIn0(W2_202,W1_204,W0_205)
| ~ aSupremumOfIn0(W2_203,W1_204,W0_205)
| ~ aSubsetOf0(W1_204,W0_205)
| ~ aSet0(W0_205) ),
inference(resolution,[status(thm)],[c_56,c_312]) ).
tff(c_319,plain,
! [W2_203] :
( sdtlseqdt0(xv,W2_203)
| ~ aSupremumOfIn0(W2_203,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_68,c_317]) ).
tff(c_346,plain,
! [W2_209] :
( sdtlseqdt0(xv,W2_209)
| ~ aSupremumOfIn0(W2_209,xS,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_66,c_319]) ).
tff(c_354,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[c_70,c_346]) ).
tff(c_24,plain,
! [W1_24,W0_23] :
( ( W1_24 = W0_23 )
| ~ sdtlseqdt0(W1_24,W0_23)
| ~ sdtlseqdt0(W0_23,W1_24)
| ~ aElement0(W1_24)
| ~ aElement0(W0_23) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_369,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[status(thm)],[c_354,c_24]) ).
tff(c_375,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xu,xv) ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_123,c_369]) ).
tff(c_376,plain,
~ sdtlseqdt0(xu,xv),
inference(negUnitSimplification,[status(thm)],[c_72,c_375]) ).
tff(c_321,plain,
! [W2_203] :
( sdtlseqdt0(xu,W2_203)
| ~ aSupremumOfIn0(W2_203,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_70,c_317]) ).
tff(c_377,plain,
! [W2_210] :
( sdtlseqdt0(xu,W2_210)
| ~ aSupremumOfIn0(W2_210,xS,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_66,c_321]) ).
tff(c_380,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[c_68,c_377]) ).
tff(c_387,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_376,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:28:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.25/2.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.25/2.19
% 4.25/2.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.86/2.23
% 4.86/2.23 Inference rules
% 4.86/2.23 ----------------------
% 4.86/2.23 #Ref : 0
% 4.86/2.23 #Sup : 63
% 4.86/2.23 #Fact : 0
% 4.86/2.23 #Define : 0
% 4.86/2.23 #Split : 0
% 4.86/2.23 #Chain : 0
% 4.86/2.23 #Close : 0
% 4.86/2.23
% 4.86/2.23 Ordering : KBO
% 4.86/2.23
% 4.86/2.23 Simplification rules
% 4.86/2.23 ----------------------
% 4.86/2.23 #Subsume : 7
% 4.86/2.23 #Demod : 28
% 4.86/2.23 #Tautology : 14
% 4.86/2.23 #SimpNegUnit : 2
% 4.86/2.23 #BackRed : 0
% 4.86/2.23
% 4.86/2.23 #Partial instantiations: 0
% 4.86/2.23 #Strategies tried : 1
% 4.86/2.23
% 4.86/2.23 Timing (in seconds)
% 4.86/2.23 ----------------------
% 4.86/2.24 Preprocessing : 0.56
% 4.86/2.24 Parsing : 0.29
% 4.86/2.24 CNF conversion : 0.05
% 4.86/2.24 Main loop : 0.56
% 4.86/2.24 Inferencing : 0.24
% 4.86/2.24 Reduction : 0.14
% 4.86/2.24 Demodulation : 0.09
% 4.86/2.24 BG Simplification : 0.03
% 4.86/2.24 Subsumption : 0.12
% 4.86/2.24 Abstraction : 0.02
% 4.86/2.24 MUC search : 0.00
% 4.86/2.24 Cooper : 0.00
% 4.86/2.24 Total : 1.20
% 4.86/2.24 Index Insertion : 0.00
% 4.86/2.24 Index Deletion : 0.00
% 4.86/2.24 Index Matching : 0.00
% 4.86/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------