TSTP Solution File: LCL644+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL644+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/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 : n029.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:29 EDT 2023
% Result : Theorem 14.51s 9.39s
% Output : CNFRefutation 14.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 14
% Syntax : Number of formulae : 17 ( 3 unt; 13 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 53 ( 14 avg)
% Number of connectives : 87 ( 35 ~; 36 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-1 aty)
% Number of variables : 20 (; 19 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p2 > p1 > #nlpp > #skF_2 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_1 > #skF_9 > #skF_8 > #skF_4 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(p2,type,
p2: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(p1,type,
p1: $i > $o ).
tff(f_185,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p2(X)
& ! [Y] :
( ~ r1(X,Y)
| p2(Y) ) )
| p1(X) )
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y)
| ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ ( p1(X)
& ! [Y] :
( ~ r1(X,Y)
| p1(Y) )
& p1(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y)
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) ) ) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ ( ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ ( ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
tff(c_14,plain,
~ p1('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_10,plain,
p1('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_5201,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL644+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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 : n029.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 14:14:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 14.51/9.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.51/9.39
% 14.51/9.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.86/9.43
% 14.86/9.43 Inference rules
% 14.86/9.43 ----------------------
% 14.86/9.43 #Ref : 0
% 14.86/9.43 #Sup : 0
% 14.86/9.43 #Fact : 0
% 14.86/9.43 #Define : 0
% 14.86/9.43 #Split : 0
% 14.86/9.43 #Chain : 0
% 14.86/9.43 #Close : 0
% 14.86/9.43
% 14.86/9.43 Ordering : KBO
% 14.86/9.43
% 14.86/9.43 Simplification rules
% 14.86/9.43 ----------------------
% 14.86/9.43 #Subsume : 2599
% 14.86/9.43 #Demod : 0
% 14.86/9.43 #Tautology : 0
% 14.86/9.43 #SimpNegUnit : 1
% 14.86/9.43 #BackRed : 0
% 14.86/9.43
% 14.86/9.43 #Partial instantiations: 0
% 14.86/9.43 #Strategies tried : 1
% 14.86/9.43
% 14.86/9.43 Timing (in seconds)
% 14.86/9.43 ----------------------
% 14.86/9.43 Preprocessing : 1.01
% 14.86/9.43 Parsing : 0.27
% 14.86/9.43 CNF conversion : 0.11
% 14.86/9.43 Main loop : 7.34
% 14.86/9.43 Inferencing : 0.00
% 14.86/9.43 Reduction : 2.89
% 14.86/9.43 Demodulation : 2.12
% 14.86/9.43 BG Simplification : 0.27
% 14.86/9.43 Subsumption : 4.02
% 14.86/9.43 Abstraction : 0.09
% 14.86/9.43 MUC search : 0.00
% 14.86/9.43 Cooper : 0.00
% 14.86/9.43 Total : 8.41
% 14.86/9.43 Index Insertion : 0.00
% 14.86/9.43 Index Deletion : 0.00
% 14.86/9.43 Index Matching : 0.00
% 14.86/9.43 BG Taut test : 0.00
%------------------------------------------------------------------------------