TSTP Solution File: LAT382+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT382+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 : n018.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:06 EDT 2023
% Result : Theorem 4.08s 1.96s
% Output : CNFRefutation 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 27
% Syntax : Number of formulae : 46 ( 14 unt; 22 typ; 0 def)
% Number of atoms : 64 ( 6 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 55 ( 15 ~; 15 |; 15 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 18 >; 20 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aUpperBoundOfIn0 > aSupremumOfIn0 > aLowerBoundOfIn0 > aInfimumOfIn0 > sdtlseqdt0 > aSubsetOf0 > aElementOf0 > isEmpty0 > aSet0 > aElement0 > #nlpp > xv > xu > xT > xS > #skF_7 > #skF_6 > #skF_1 > #skF_8 > #skF_4 > #skF_5 > #skF_3 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
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('#skF_8',type,
'#skF_8': $i > $i ).
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_229,negated_conjecture,
xu != xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_170,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).
tff(f_227,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(xu,W0) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W0,W1) ) )
| aLowerBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(W0,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(xv,W0) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W0,W1) ) )
| aLowerBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(W0,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__792) ).
tff(f_40,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mASymm) ).
tff(c_104,plain,
xv != xu,
inference(cnfTransformation,[status(thm)],[f_229]) ).
tff(c_66,plain,
aSet0(xT),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_82,plain,
aElementOf0(xv,xT),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_154,plain,
! [W1_144,W0_145] :
( aElement0(W1_144)
| ~ aElementOf0(W1_144,W0_145)
| ~ aSet0(W0_145) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_160,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_82,c_154]) ).
tff(c_169,plain,
aElement0(xv),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_160]) ).
tff(c_90,plain,
aElementOf0(xu,xT),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_163,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_90,c_154]) ).
tff(c_172,plain,
aElement0(xu),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_163]) ).
tff(c_76,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_110,plain,
! [W0_138] :
( ~ aLowerBoundOfIn0(W0_138,xS,xT)
| sdtlseqdt0(W0_138,xu) ),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_118,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[c_76,c_110]) ).
tff(c_86,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_145,plain,
! [W0_143] :
( ~ aLowerBoundOfIn0(W0_143,xS,xT)
| sdtlseqdt0(W0_143,xv) ),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_152,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[c_86,c_145]) ).
tff(c_286,plain,
! [W1_170,W0_171] :
( ( W1_170 = W0_171 )
| ~ sdtlseqdt0(W1_170,W0_171)
| ~ sdtlseqdt0(W0_171,W1_170)
| ~ aElement0(W1_170)
| ~ aElement0(W0_171) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_294,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[status(thm)],[c_152,c_286]) ).
tff(c_317,plain,
xv = xu,
inference(demodulation,[status(thm),theory(equality)],[c_169,c_172,c_118,c_294]) ).
tff(c_319,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_104,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LAT382+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n018.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:45:05 EDT 2023
% 0.15/0.37 % CPUTime :
% 4.08/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.08/1.97
% 4.08/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.08/1.99
% 4.08/1.99 Inference rules
% 4.08/1.99 ----------------------
% 4.08/1.99 #Ref : 0
% 4.08/1.99 #Sup : 39
% 4.08/1.99 #Fact : 0
% 4.08/1.99 #Define : 0
% 4.08/1.99 #Split : 1
% 4.08/1.99 #Chain : 0
% 4.08/1.99 #Close : 0
% 4.08/1.99
% 4.08/1.99 Ordering : KBO
% 4.08/1.99
% 4.08/1.99 Simplification rules
% 4.08/1.99 ----------------------
% 4.08/1.99 #Subsume : 10
% 4.08/1.99 #Demod : 39
% 4.08/1.99 #Tautology : 13
% 4.08/1.99 #SimpNegUnit : 1
% 4.08/1.99 #BackRed : 0
% 4.08/1.99
% 4.08/1.99 #Partial instantiations: 0
% 4.08/1.99 #Strategies tried : 1
% 4.08/1.99
% 4.08/1.99 Timing (in seconds)
% 4.08/1.99 ----------------------
% 4.08/2.00 Preprocessing : 0.57
% 4.08/2.00 Parsing : 0.30
% 4.08/2.00 CNF conversion : 0.05
% 4.08/2.00 Main loop : 0.35
% 4.08/2.00 Inferencing : 0.13
% 4.08/2.00 Reduction : 0.10
% 4.08/2.00 Demodulation : 0.07
% 4.08/2.00 BG Simplification : 0.03
% 4.08/2.00 Subsumption : 0.07
% 4.08/2.00 Abstraction : 0.01
% 4.08/2.00 MUC search : 0.00
% 4.08/2.00 Cooper : 0.00
% 4.08/2.00 Total : 0.97
% 4.08/2.00 Index Insertion : 0.00
% 4.08/2.00 Index Deletion : 0.00
% 4.08/2.00 Index Matching : 0.00
% 4.08/2.00 BG Taut test : 0.00
%------------------------------------------------------------------------------