TSTP Solution File: LCL638+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL638+1.001 : 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 : 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:48:27 EDT 2023
% Result : Theorem 3.76s 2.10s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 183 ( 93 ~; 86 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 53 (; 52 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p1 > #nlpp > #skF_7 > #skF_5 > #skF_4 > #skF_3 > #skF_1 > #skF_8 > #skF_2 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(p1,type,
p1: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_154,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ ! [X] :
( ~ r1(Y,X)
| ~ ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) )
& ~ p1(Y) ) )
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ ! [X] :
( ~ r1(Y,X)
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ p1(Y) ) )
& p1(Y) ) )
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ ! [X] :
( ~ r1(Y,X)
| ! [Y] :
( ~ r1(X,Y)
| ~ ! [X] :
( ~ r1(Y,X)
| ~ p1(X) ) ) )
& ! [X] :
( ~ r1(Y,X)
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ p1(Y) ) ) ) )
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ ! [X] :
( ~ r1(Y,X)
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) )
& ! [X] :
( ~ r1(Y,X)
| p1(X) ) ) )
| ~ ! [Y] :
( ~ r1(X,Y)
| ~ ! [X] :
( ~ r1(Y,X)
| $false ) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ ! [X] :
( ~ r1(Y,X)
| p1(X) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(c_4,plain,
~ p1('#skF_8'),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_6,plain,
r1('#skF_1','#skF_8'),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_8,plain,
! [Y_90] :
( r1(Y_90,'#skF_7'(Y_90))
| ~ r1('#skF_1',Y_90) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_28,plain,
! [X_55,Y_51] :
( r1(X_55,'#skF_2'(Y_51,X_55))
| p1(Y_51)
| ~ r1(Y_51,X_55)
| ~ r1('#skF_1',Y_51) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_63,plain,
! [Y_109,Y_110,X_111] :
( r1(Y_109,'#skF_6'(Y_109))
| p1(Y_110)
| ~ r1(X_111,Y_110)
| ~ r1(Y_109,X_111)
| ~ r1('#skF_1',Y_109) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_278,plain,
! [Y_136,Y_137,X_138] :
( r1(Y_136,'#skF_6'(Y_136))
| p1('#skF_2'(Y_137,X_138))
| ~ r1(Y_136,X_138)
| ~ r1('#skF_1',Y_136)
| p1(Y_137)
| ~ r1(Y_137,X_138)
| ~ r1('#skF_1',Y_137) ),
inference(resolution,[status(thm)],[c_28,c_63]) ).
tff(c_309,plain,
! [Y_139,Y_140] :
( r1(Y_139,'#skF_6'(Y_139))
| p1('#skF_2'(Y_140,'#skF_7'(Y_139)))
| p1(Y_140)
| ~ r1(Y_140,'#skF_7'(Y_139))
| ~ r1('#skF_1',Y_140)
| ~ r1('#skF_1',Y_139) ),
inference(resolution,[status(thm)],[c_8,c_278]) ).
tff(c_26,plain,
! [Y_51,X_55] :
( ~ p1('#skF_2'(Y_51,X_55))
| p1(Y_51)
| ~ r1(Y_51,X_55)
| ~ r1('#skF_1',Y_51) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_336,plain,
! [Y_141,Y_142] :
( r1(Y_141,'#skF_6'(Y_141))
| p1(Y_142)
| ~ r1(Y_142,'#skF_7'(Y_141))
| ~ r1('#skF_1',Y_142)
| ~ r1('#skF_1',Y_141) ),
inference(resolution,[status(thm)],[c_309,c_26]) ).
tff(c_339,plain,
! [Y_90] :
( r1(Y_90,'#skF_6'(Y_90))
| p1(Y_90)
| ~ r1('#skF_1',Y_90) ),
inference(resolution,[status(thm)],[c_8,c_336]) ).
tff(c_340,plain,
! [Y_143] :
( r1(Y_143,'#skF_6'(Y_143))
| p1(Y_143)
| ~ r1('#skF_1',Y_143) ),
inference(resolution,[status(thm)],[c_8,c_336]) ).
tff(c_2,plain,
! [X_93] :
( p1(X_93)
| ~ r1('#skF_8',X_93) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_358,plain,
( p1('#skF_6'('#skF_8'))
| p1('#skF_8')
| ~ r1('#skF_1','#skF_8') ),
inference(resolution,[status(thm)],[c_340,c_2]) ).
tff(c_367,plain,
( p1('#skF_6'('#skF_8'))
| p1('#skF_8') ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_358]) ).
tff(c_368,plain,
p1('#skF_6'('#skF_8')),
inference(negUnitSimplification,[status(thm)],[c_4,c_367]) ).
tff(c_10,plain,
! [Y_82,Y_89,X_87] :
( ~ p1('#skF_6'(Y_82))
| p1(Y_89)
| ~ r1(X_87,Y_89)
| ~ r1(Y_82,X_87)
| ~ r1('#skF_1',Y_82) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_370,plain,
! [Y_89,X_87] :
( p1(Y_89)
| ~ r1(X_87,Y_89)
| ~ r1('#skF_8',X_87)
| ~ r1('#skF_1','#skF_8') ),
inference(resolution,[status(thm)],[c_368,c_10]) ).
tff(c_375,plain,
! [Y_147,X_148] :
( p1(Y_147)
| ~ r1(X_148,Y_147)
| ~ r1('#skF_8',X_148) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_370]) ).
tff(c_423,plain,
! [Y_151,X_152] :
( p1('#skF_2'(Y_151,X_152))
| ~ r1('#skF_8',X_152)
| p1(Y_151)
| ~ r1(Y_151,X_152)
| ~ r1('#skF_1',Y_151) ),
inference(resolution,[status(thm)],[c_28,c_375]) ).
tff(c_428,plain,
! [X_153,Y_154] :
( ~ r1('#skF_8',X_153)
| p1(Y_154)
| ~ r1(Y_154,X_153)
| ~ r1('#skF_1',Y_154) ),
inference(resolution,[status(thm)],[c_423,c_26]) ).
tff(c_431,plain,
! [Y_154] :
( p1(Y_154)
| ~ r1(Y_154,'#skF_6'('#skF_8'))
| ~ r1('#skF_1',Y_154)
| p1('#skF_8')
| ~ r1('#skF_1','#skF_8') ),
inference(resolution,[status(thm)],[c_339,c_428]) ).
tff(c_457,plain,
! [Y_154] :
( p1(Y_154)
| ~ r1(Y_154,'#skF_6'('#skF_8'))
| ~ r1('#skF_1',Y_154)
| p1('#skF_8') ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_431]) ).
tff(c_474,plain,
! [Y_155] :
( p1(Y_155)
| ~ r1(Y_155,'#skF_6'('#skF_8'))
| ~ r1('#skF_1',Y_155) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_457]) ).
tff(c_478,plain,
( p1('#skF_8')
| ~ r1('#skF_1','#skF_8') ),
inference(resolution,[status(thm)],[c_339,c_474]) ).
tff(c_489,plain,
p1('#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_478]) ).
tff(c_491,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_489]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL638+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.14/0.33 % Computer : n006.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Thu Aug 3 13:41:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 3.76/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.95/2.11
% 3.95/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.95/2.14
% 3.95/2.14 Inference rules
% 3.95/2.14 ----------------------
% 3.95/2.14 #Ref : 0
% 3.95/2.14 #Sup : 109
% 3.95/2.14 #Fact : 0
% 3.95/2.14 #Define : 0
% 3.95/2.14 #Split : 3
% 3.95/2.14 #Chain : 0
% 3.95/2.14 #Close : 0
% 3.95/2.14
% 3.95/2.14 Ordering : KBO
% 3.95/2.14
% 3.95/2.14 Simplification rules
% 3.95/2.14 ----------------------
% 3.95/2.14 #Subsume : 33
% 3.95/2.14 #Demod : 16
% 3.95/2.14 #Tautology : 1
% 3.95/2.14 #SimpNegUnit : 5
% 3.95/2.14 #BackRed : 0
% 3.95/2.14
% 3.95/2.14 #Partial instantiations: 0
% 3.95/2.14 #Strategies tried : 1
% 3.95/2.14
% 3.95/2.14 Timing (in seconds)
% 3.95/2.14 ----------------------
% 3.95/2.14 Preprocessing : 0.50
% 3.95/2.14 Parsing : 0.27
% 3.95/2.14 CNF conversion : 0.05
% 4.56/2.14 Main loop : 0.51
% 4.56/2.14 Inferencing : 0.21
% 4.56/2.14 Reduction : 0.11
% 4.56/2.14 Demodulation : 0.07
% 4.56/2.14 BG Simplification : 0.03
% 4.56/2.14 Subsumption : 0.12
% 4.56/2.14 Abstraction : 0.02
% 4.56/2.15 MUC search : 0.00
% 4.56/2.15 Cooper : 0.00
% 4.56/2.15 Total : 1.06
% 4.56/2.15 Index Insertion : 0.00
% 4.56/2.15 Index Deletion : 0.00
% 4.56/2.15 Index Matching : 0.00
% 4.56/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------