TSTP Solution File: LCL678+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL678+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 : n027.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:46 EDT 2023
% Result : Theorem 2.10s 1.61s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 29 ( 17 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 (; 12 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p1 > #nlpp > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(p1,type,
p1: $i > $o ).
tff(f_28,axiom,
! [X] : r1(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
tff(f_63,negated_conjecture,
~ ~ ? [X] :
~ ( $false
| ~ ! [Y] :
( ~ r1(X,Y)
| $false
| ~ ! [X] :
( ~ r1(Y,X)
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(c_2,plain,
! [X_1] : r1(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_10,plain,
! [Y_16] :
( r1('#skF_2'(Y_16),'#skF_3'(Y_16))
| ~ r1('#skF_1',Y_16) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_27,plain,
! [Y_32,Y_33] :
( p1(Y_32)
| ~ r1('#skF_2'(Y_33),Y_32)
| ~ r1('#skF_1',Y_33) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_42,plain,
! [Y_34] :
( p1('#skF_3'(Y_34))
| ~ r1('#skF_1',Y_34) ),
inference(resolution,[status(thm)],[c_10,c_27]) ).
tff(c_8,plain,
! [Y_16] :
( ~ p1('#skF_3'(Y_16))
| ~ r1('#skF_1',Y_16) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_47,plain,
! [Y_35] : ~ r1('#skF_1',Y_35),
inference(resolution,[status(thm)],[c_42,c_8]) ).
tff(c_52,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL678+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.18/0.35 % Computer : n027.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 14:06:54 EDT 2023
% 0.18/0.35 % CPUTime :
% 2.10/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.62
% 2.78/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.65
% 2.78/1.65 Inference rules
% 2.78/1.65 ----------------------
% 2.78/1.65 #Ref : 0
% 2.78/1.65 #Sup : 8
% 2.78/1.65 #Fact : 0
% 2.78/1.65 #Define : 0
% 2.78/1.65 #Split : 0
% 2.78/1.65 #Chain : 0
% 2.78/1.65 #Close : 0
% 2.78/1.65
% 2.78/1.65 Ordering : KBO
% 2.78/1.65
% 2.78/1.65 Simplification rules
% 2.78/1.65 ----------------------
% 2.78/1.65 #Subsume : 5
% 2.78/1.65 #Demod : 0
% 2.78/1.65 #Tautology : 1
% 2.78/1.65 #SimpNegUnit : 0
% 2.78/1.65 #BackRed : 0
% 2.78/1.65
% 2.78/1.65 #Partial instantiations: 0
% 2.78/1.65 #Strategies tried : 1
% 2.78/1.65
% 2.78/1.65 Timing (in seconds)
% 2.78/1.65 ----------------------
% 2.90/1.65 Preprocessing : 0.41
% 2.90/1.65 Parsing : 0.23
% 2.90/1.65 CNF conversion : 0.03
% 2.90/1.66 Main loop : 0.17
% 2.90/1.66 Inferencing : 0.07
% 2.90/1.66 Reduction : 0.03
% 2.90/1.66 Demodulation : 0.02
% 2.90/1.66 BG Simplification : 0.01
% 2.90/1.66 Subsumption : 0.04
% 2.90/1.66 Abstraction : 0.01
% 2.90/1.66 MUC search : 0.00
% 2.90/1.66 Cooper : 0.00
% 2.90/1.66 Total : 0.63
% 2.90/1.66 Index Insertion : 0.00
% 2.90/1.66 Index Deletion : 0.00
% 2.90/1.66 Index Matching : 0.00
% 2.90/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------