TSTP Solution File: LAT382+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT382+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 : n003.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 3.99s 1.97s
% Output : CNFRefutation 3.99s
% 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_176,negated_conjecture,
xu != xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_170,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
tff(f_171,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
tff(f_174,hypothesis,
( aInfimumOfIn0(xu,xS,xT)
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
tff(f_140,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aInfimumOfIn0(W2,W1,W0)
<=> ( aElementOf0(W2,W0)
& aLowerBoundOfIn0(W2,W1,W0)
& ! [W3] :
( aLowerBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W3,W2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
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_74,plain,
xv != xu,
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_66,plain,
aSet0(xT),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_68,plain,
aSubsetOf0(xS,xT),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_70,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_135,plain,
! [W2_156,W0_157,W1_158] :
( aElementOf0(W2_156,W0_157)
| ~ aInfimumOfIn0(W2_156,W1_158,W0_157)
| ~ aSubsetOf0(W1_158,W0_157)
| ~ aSet0(W0_157) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_138,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_70,c_135]) ).
tff(c_144,plain,
aElementOf0(xv,xT),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_68,c_138]) ).
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_155,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_144,c_6]) ).
tff(c_162,plain,
aElement0(xv),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_155]) ).
tff(c_72,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_141,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_72,c_135]) ).
tff(c_147,plain,
aElementOf0(xu,xT),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_68,c_141]) ).
tff(c_171,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_147,c_6]) ).
tff(c_178,plain,
aElement0(xu),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_171]) ).
tff(c_46,plain,
! [W2_90,W1_84,W0_72] :
( aLowerBoundOfIn0(W2_90,W1_84,W0_72)
| ~ aInfimumOfIn0(W2_90,W1_84,W0_72)
| ~ aSubsetOf0(W1_84,W0_72)
| ~ aSet0(W0_72) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_310,plain,
! [W3_203,W2_204,W1_205,W0_206] :
( sdtlseqdt0(W3_203,W2_204)
| ~ aLowerBoundOfIn0(W3_203,W1_205,W0_206)
| ~ aInfimumOfIn0(W2_204,W1_205,W0_206)
| ~ aSubsetOf0(W1_205,W0_206)
| ~ aSet0(W0_206) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_319,plain,
! [W2_213,W2_214,W1_215,W0_216] :
( sdtlseqdt0(W2_213,W2_214)
| ~ aInfimumOfIn0(W2_214,W1_215,W0_216)
| ~ aInfimumOfIn0(W2_213,W1_215,W0_216)
| ~ aSubsetOf0(W1_215,W0_216)
| ~ aSet0(W0_216) ),
inference(resolution,[status(thm)],[c_46,c_310]) ).
tff(c_321,plain,
! [W2_213] :
( sdtlseqdt0(W2_213,xv)
| ~ aInfimumOfIn0(W2_213,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_70,c_319]) ).
tff(c_331,plain,
! [W2_220] :
( sdtlseqdt0(W2_220,xv)
| ~ aInfimumOfIn0(W2_220,xS,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_68,c_321]) ).
tff(c_339,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[c_72,c_331]) ).
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_354,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[status(thm)],[c_339,c_24]) ).
tff(c_360,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xv,xu) ),
inference(demodulation,[status(thm),theory(equality)],[c_162,c_178,c_354]) ).
tff(c_361,plain,
~ sdtlseqdt0(xv,xu),
inference(negUnitSimplification,[status(thm)],[c_74,c_360]) ).
tff(c_323,plain,
! [W2_213] :
( sdtlseqdt0(W2_213,xu)
| ~ aInfimumOfIn0(W2_213,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_72,c_319]) ).
tff(c_362,plain,
! [W2_221] :
( sdtlseqdt0(W2_221,xu)
| ~ aInfimumOfIn0(W2_221,xS,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_68,c_323]) ).
tff(c_365,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[c_70,c_362]) ).
tff(c_372,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_361,c_365]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 12:23:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.99/1.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/1.97
% 3.99/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.99/2.01
% 3.99/2.01 Inference rules
% 3.99/2.01 ----------------------
% 3.99/2.01 #Ref : 0
% 3.99/2.01 #Sup : 58
% 3.99/2.01 #Fact : 0
% 3.99/2.01 #Define : 0
% 3.99/2.01 #Split : 0
% 3.99/2.01 #Chain : 0
% 3.99/2.01 #Close : 0
% 3.99/2.01
% 3.99/2.01 Ordering : KBO
% 3.99/2.01
% 3.99/2.01 Simplification rules
% 3.99/2.01 ----------------------
% 3.99/2.01 #Subsume : 7
% 3.99/2.01 #Demod : 28
% 3.99/2.01 #Tautology : 14
% 3.99/2.01 #SimpNegUnit : 2
% 3.99/2.01 #BackRed : 0
% 3.99/2.01
% 3.99/2.01 #Partial instantiations: 0
% 3.99/2.01 #Strategies tried : 1
% 3.99/2.01
% 3.99/2.01 Timing (in seconds)
% 3.99/2.01 ----------------------
% 3.99/2.01 Preprocessing : 0.55
% 3.99/2.01 Parsing : 0.29
% 3.99/2.01 CNF conversion : 0.05
% 3.99/2.01 Main loop : 0.37
% 3.99/2.01 Inferencing : 0.15
% 3.99/2.01 Reduction : 0.09
% 3.99/2.01 Demodulation : 0.07
% 3.99/2.01 BG Simplification : 0.03
% 3.99/2.01 Subsumption : 0.08
% 3.99/2.01 Abstraction : 0.01
% 3.99/2.01 MUC search : 0.00
% 3.99/2.01 Cooper : 0.00
% 3.99/2.01 Total : 0.98
% 3.99/2.01 Index Insertion : 0.00
% 3.99/2.01 Index Deletion : 0.00
% 3.99/2.01 Index Matching : 0.00
% 3.99/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------