TSTP Solution File: RNG095+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG095+2 : 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 : n014.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:54:56 EDT 2023
% Result : Theorem 5.03s 2.37s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 34
% Syntax : Number of formulae : 43 ( 4 unt; 31 typ; 0 def)
% Number of atoms : 28 ( 6 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 31 ( 15 ~; 10 |; 5 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 52 ( 25 >; 27 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 6 con; 0-4 aty)
% Number of variables : 12 (; 8 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xy > xx > xJ > xI > sz10 > sz00 > #skF_6 > #skF_4 > #skF_8 > #skF_15 > #skF_5 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_14 > #skF_2 > #skF_12 > #skF_1 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xI,type,
xI: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff(xy,type,
xy: $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xJ,type,
xJ: $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_271,hypothesis,
! [W0] :
( aElement0(W0)
=> ( ? [W1,W2] :
( aElementOf0(W1,xI)
& aElementOf0(W2,xJ)
& ( sdtpldt0(W1,W2) = W0 ) )
& aElementOf0(W0,sdtpldt1(xI,xJ)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).
tff(f_281,negated_conjecture,
~ ? [W0,W1] :
( aElementOf0(W0,xI)
& aElementOf0(W1,xJ)
& ( sdtpldt0(W0,W1) = sz10 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_31,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
tff(c_154,plain,
! [W0_152] :
( aElementOf0('#skF_14'(W0_152),xI)
| ~ aElement0(W0_152) ),
inference(cnfTransformation,[status(thm)],[f_271]) ).
tff(c_152,plain,
! [W0_152] :
( aElementOf0('#skF_15'(W0_152),xJ)
| ~ aElement0(W0_152) ),
inference(cnfTransformation,[status(thm)],[f_271]) ).
tff(c_1793,plain,
! [W0_242] :
( ( sdtpldt0('#skF_14'(W0_242),'#skF_15'(W0_242)) = W0_242 )
| ~ aElement0(W0_242) ),
inference(cnfTransformation,[status(thm)],[f_271]) ).
tff(c_160,plain,
! [W0_155,W1_156] :
( ( sdtpldt0(W0_155,W1_156) != sz10 )
| ~ aElementOf0(W1_156,xJ)
| ~ aElementOf0(W0_155,xI) ),
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_1843,plain,
! [W0_244] :
( ( sz10 != W0_244 )
| ~ aElementOf0('#skF_15'(W0_244),xJ)
| ~ aElementOf0('#skF_14'(W0_244),xI)
| ~ aElement0(W0_244) ),
inference(superposition,[status(thm),theory(equality)],[c_1793,c_160]) ).
tff(c_2431,plain,
! [W0_260] :
( ( sz10 != W0_260 )
| ~ aElementOf0('#skF_14'(W0_260),xI)
| ~ aElement0(W0_260) ),
inference(resolution,[status(thm)],[c_152,c_1843]) ).
tff(c_2436,plain,
~ aElement0(sz10),
inference(resolution,[status(thm)],[c_154,c_2431]) ).
tff(c_6,plain,
aElement0(sz10),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_2438,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2436,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG095+2 : 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.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:52:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.03/2.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.03/2.37
% 5.03/2.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.03/2.40
% 6.03/2.40 Inference rules
% 6.03/2.40 ----------------------
% 6.03/2.40 #Ref : 0
% 6.03/2.40 #Sup : 522
% 6.03/2.40 #Fact : 0
% 6.03/2.40 #Define : 0
% 6.03/2.40 #Split : 8
% 6.03/2.40 #Chain : 0
% 6.03/2.40 #Close : 0
% 6.03/2.40
% 6.03/2.40 Ordering : KBO
% 6.03/2.40
% 6.03/2.40 Simplification rules
% 6.03/2.40 ----------------------
% 6.03/2.40 #Subsume : 94
% 6.03/2.40 #Demod : 390
% 6.03/2.40 #Tautology : 276
% 6.03/2.40 #SimpNegUnit : 38
% 6.03/2.40 #BackRed : 8
% 6.03/2.40
% 6.03/2.40 #Partial instantiations: 0
% 6.03/2.40 #Strategies tried : 1
% 6.03/2.40
% 6.03/2.40 Timing (in seconds)
% 6.03/2.40 ----------------------
% 6.03/2.40 Preprocessing : 0.66
% 6.03/2.40 Parsing : 0.32
% 6.03/2.40 CNF conversion : 0.06
% 6.03/2.40 Main loop : 0.68
% 6.03/2.40 Inferencing : 0.23
% 6.03/2.40 Reduction : 0.21
% 6.03/2.40 Demodulation : 0.15
% 6.03/2.40 BG Simplification : 0.05
% 6.03/2.40 Subsumption : 0.14
% 6.03/2.40 Abstraction : 0.03
% 6.03/2.40 MUC search : 0.00
% 6.03/2.40 Cooper : 0.00
% 6.03/2.40 Total : 1.38
% 6.03/2.40 Index Insertion : 0.00
% 6.03/2.40 Index Deletion : 0.00
% 6.03/2.40 Index Matching : 0.00
% 6.03/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------