TSTP Solution File: LCL682+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL682+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 : n009.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:47 EDT 2023
% Result : Theorem 3.05s 1.69s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 17
% Syntax : Number of formulae : 24 ( 5 unt; 16 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 49 ( 26 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 16 (; 15 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p16 > p15 > p14 > p13 > p12 > p11 > #nlpp > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_8 > #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_7',type,
'#skF_7': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $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('#skF_9',type,
'#skF_9': $i ).
tff(p13,type,
p13: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(p16,type,
p16: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_111,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ ! [X] :
( ~ r1(Y,X)
| p16(X) )
| ~ ! [X] :
( ~ r1(Y,X)
| p12(X) )
| ~ ! [X] :
( ~ r1(Y,X)
| p14(X) )
| ~ ! [X] :
( ~ r1(Y,X)
| p12(X) ) ) )
| ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| p15(X) ) )
| ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| p13(X) ) )
| ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| p12(X) ) )
| ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| p11(X) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(c_12,plain,
~ p12('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_16,plain,
r1('#skF_1','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_14,plain,
r1('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_38,plain,
! [X_40,Y_41] :
( p12(X_40)
| ~ r1(Y_41,X_40)
| ~ r1('#skF_1',Y_41) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_48,plain,
( p12('#skF_7')
| ~ r1('#skF_1','#skF_6') ),
inference(resolution,[status(thm)],[c_14,c_38]) ).
tff(c_71,plain,
p12('#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_48]) ).
tff(c_73,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL682+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/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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 13:33:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.05/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.69
% 3.05/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/1.72
% 3.35/1.72 Inference rules
% 3.35/1.72 ----------------------
% 3.35/1.72 #Ref : 0
% 3.35/1.72 #Sup : 9
% 3.35/1.72 #Fact : 0
% 3.35/1.72 #Define : 0
% 3.35/1.72 #Split : 0
% 3.35/1.72 #Chain : 0
% 3.35/1.72 #Close : 0
% 3.35/1.72
% 3.35/1.72 Ordering : KBO
% 3.35/1.72
% 3.35/1.72 Simplification rules
% 3.35/1.72 ----------------------
% 3.35/1.72 #Subsume : 1
% 3.35/1.72 #Demod : 5
% 3.35/1.72 #Tautology : 0
% 3.35/1.72 #SimpNegUnit : 1
% 3.35/1.72 #BackRed : 0
% 3.35/1.72
% 3.35/1.72 #Partial instantiations: 0
% 3.35/1.72 #Strategies tried : 1
% 3.35/1.72
% 3.35/1.72 Timing (in seconds)
% 3.35/1.72 ----------------------
% 3.35/1.72 Preprocessing : 0.46
% 3.35/1.72 Parsing : 0.26
% 3.35/1.72 CNF conversion : 0.04
% 3.35/1.72 Main loop : 0.19
% 3.35/1.72 Inferencing : 0.08
% 3.35/1.72 Reduction : 0.05
% 3.35/1.72 Demodulation : 0.04
% 3.35/1.72 BG Simplification : 0.02
% 3.35/1.72 Subsumption : 0.04
% 3.35/1.72 Abstraction : 0.01
% 3.35/1.72 MUC search : 0.00
% 3.35/1.72 Cooper : 0.00
% 3.35/1.72 Total : 0.70
% 3.35/1.72 Index Insertion : 0.00
% 3.35/1.72 Index Deletion : 0.00
% 3.35/1.72 Index Matching : 0.00
% 3.35/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------