TSTP Solution File: LAT381+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT381+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/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 : n006.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.04s 1.94s
% Output : CNFRefutation 4.04s
% 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_217,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_215,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(W0,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W1,W0) ) )
| aUpperBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(xu,W0) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(W0,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W1,W0) ) )
| aUpperBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(xv,W0) )
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
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_102,plain,
xv != xu,
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_64,plain,
aSet0(xT),
inference(cnfTransformation,[status(thm)],[f_158]) ).
tff(c_88,plain,
aElementOf0(xu,xT),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_133,plain,
! [W1_131,W0_132] :
( aElement0(W1_131)
| ~ aElementOf0(W1_131,W0_132)
| ~ aSet0(W0_132) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_142,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_88,c_133]) ).
tff(c_151,plain,
aElement0(xu),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_142]) ).
tff(c_80,plain,
aElementOf0(xv,xT),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_139,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_80,c_133]) ).
tff(c_148,plain,
aElement0(xv),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_139]) ).
tff(c_74,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_108,plain,
! [W0_127] :
( ~ aUpperBoundOfIn0(W0_127,xS,xT)
| sdtlseqdt0(xu,W0_127) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_116,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[c_74,c_108]) ).
tff(c_84,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_124,plain,
! [W0_130] :
( ~ aUpperBoundOfIn0(W0_130,xS,xT)
| sdtlseqdt0(xv,W0_130) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_131,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[c_84,c_124]) ).
tff(c_361,plain,
! [W1_169,W0_170] :
( ( W1_169 = W0_170 )
| ~ sdtlseqdt0(W1_169,W0_170)
| ~ sdtlseqdt0(W0_170,W1_169)
| ~ aElement0(W1_169)
| ~ aElement0(W0_170) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_369,plain,
( ( xv = xu )
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[status(thm)],[c_131,c_361]) ).
tff(c_392,plain,
xv = xu,
inference(demodulation,[status(thm),theory(equality)],[c_151,c_148,c_116,c_369]) ).
tff(c_394,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_102,c_392]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT381+3 : 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.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:18:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.04/1.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.04/1.94
% 4.04/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.04/1.97
% 4.04/1.97 Inference rules
% 4.04/1.97 ----------------------
% 4.04/1.97 #Ref : 0
% 4.04/1.97 #Sup : 52
% 4.04/1.97 #Fact : 0
% 4.04/1.97 #Define : 0
% 4.04/1.97 #Split : 1
% 4.04/1.97 #Chain : 0
% 4.04/1.97 #Close : 0
% 4.04/1.97
% 4.04/1.97 Ordering : KBO
% 4.04/1.97
% 4.04/1.97 Simplification rules
% 4.04/1.97 ----------------------
% 4.04/1.97 #Subsume : 14
% 4.04/1.97 #Demod : 48
% 4.04/1.97 #Tautology : 16
% 4.04/1.97 #SimpNegUnit : 1
% 4.04/1.97 #BackRed : 0
% 4.04/1.97
% 4.04/1.97 #Partial instantiations: 0
% 4.04/1.97 #Strategies tried : 1
% 4.04/1.97
% 4.04/1.97 Timing (in seconds)
% 4.04/1.97 ----------------------
% 4.04/1.97 Preprocessing : 0.56
% 4.04/1.97 Parsing : 0.29
% 4.04/1.97 CNF conversion : 0.05
% 4.04/1.97 Main loop : 0.36
% 4.04/1.97 Inferencing : 0.14
% 4.04/1.97 Reduction : 0.10
% 4.04/1.97 Demodulation : 0.07
% 4.04/1.97 BG Simplification : 0.03
% 4.04/1.97 Subsumption : 0.08
% 4.04/1.97 Abstraction : 0.01
% 4.04/1.97 MUC search : 0.00
% 4.04/1.97 Cooper : 0.00
% 4.04/1.97 Total : 0.96
% 4.04/1.97 Index Insertion : 0.00
% 4.04/1.97 Index Deletion : 0.00
% 4.04/1.97 Index Matching : 0.00
% 4.04/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------