TSTP Solution File: LCL664+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL664+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:41 EDT 2023
% Result : Theorem 2.74s 1.58s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 33 ( 17 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 7 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p16 > p15 > p14 > p13 > p12 > p11 > #nlpp > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p12,type,
p12: $i > $o ).
tff(p15,type,
p15: $i > $o ).
tff(p11,type,
p11: $i > $o ).
tff(p14,type,
p14: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(p13,type,
p13: $i > $o ).
tff(p16,type,
p16: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_83,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p16(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p12(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p14(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p12(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p15(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p13(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p12(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p11(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
tff(c_8,plain,
~ p12('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_10,plain,
r1('#skF_1','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_28,plain,
! [Y_15] :
( p12(Y_15)
| ~ r1('#skF_1',Y_15) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_41,plain,
p12('#skF_4'),
inference(resolution,[status(thm)],[c_10,c_28]) ).
tff(c_51,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL664+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.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 14:24:22 EDT 2023
% 0.16/0.34 % CPUTime :
% 2.74/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/1.58
% 2.74/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.93/1.60
% 2.93/1.60 Inference rules
% 2.93/1.60 ----------------------
% 2.93/1.60 #Ref : 0
% 2.93/1.60 #Sup : 5
% 2.93/1.60 #Fact : 0
% 2.93/1.60 #Define : 0
% 2.93/1.60 #Split : 0
% 2.93/1.60 #Chain : 0
% 2.93/1.60 #Close : 0
% 2.93/1.60
% 2.93/1.60 Ordering : KBO
% 2.93/1.60
% 2.93/1.60 Simplification rules
% 2.93/1.60 ----------------------
% 2.93/1.60 #Subsume : 1
% 2.93/1.60 #Demod : 0
% 2.93/1.60 #Tautology : 0
% 2.93/1.60 #SimpNegUnit : 1
% 2.93/1.60 #BackRed : 0
% 2.93/1.60
% 2.93/1.60 #Partial instantiations: 0
% 2.93/1.60 #Strategies tried : 1
% 2.93/1.60
% 2.93/1.60 Timing (in seconds)
% 2.93/1.60 ----------------------
% 2.97/1.61 Preprocessing : 0.40
% 2.97/1.61 Parsing : 0.22
% 2.97/1.61 CNF conversion : 0.03
% 2.97/1.61 Main loop : 0.17
% 2.97/1.61 Inferencing : 0.07
% 2.97/1.61 Reduction : 0.04
% 2.97/1.61 Demodulation : 0.03
% 2.97/1.61 BG Simplification : 0.01
% 2.97/1.61 Subsumption : 0.04
% 2.97/1.61 Abstraction : 0.01
% 2.97/1.61 MUC search : 0.00
% 2.97/1.61 Cooper : 0.00
% 2.97/1.61 Total : 0.61
% 2.97/1.61 Index Insertion : 0.00
% 2.97/1.61 Index Deletion : 0.00
% 2.97/1.61 Index Matching : 0.00
% 2.97/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------