TSTP Solution File: LCL397-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL397-1 : TPTP v8.1.2. Released v2.3.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 : n003.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:01 EDT 2023
% Result : Unsatisfiable 2.98s 1.79s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > y > x
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X] : is_a_theorem(implies(implies(not(X),X),X)),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_40,axiom,
~ is_a_theorem(implies(x,implies(y,y))),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_7,Y_8] : is_a_theorem(implies(X_7,implies(not(X_7),Y_8))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_6,plain,
! [X_6] : is_a_theorem(implies(implies(not(X_6),X_6),X_6)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_23,plain,
! [X_15,Y_16,Z_17] : is_a_theorem(implies(implies(X_15,Y_16),implies(implies(Y_16,Z_17),implies(X_15,Z_17)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_40,plain,
! [Y_21,Z_22,X_23] :
( is_a_theorem(implies(implies(Y_21,Z_22),implies(X_23,Z_22)))
| ~ is_a_theorem(implies(X_23,Y_21)) ),
inference(resolution,[status(thm)],[c_23,c_2]) ).
tff(c_45,plain,
! [X_24,Z_25,Y_26] :
( is_a_theorem(implies(X_24,Z_25))
| ~ is_a_theorem(implies(Y_26,Z_25))
| ~ is_a_theorem(implies(X_24,Y_26)) ),
inference(resolution,[status(thm)],[c_40,c_2]) ).
tff(c_83,plain,
! [X_33,X_34] :
( is_a_theorem(implies(X_33,X_34))
| ~ is_a_theorem(implies(X_33,implies(not(X_34),X_34))) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_108,plain,
! [Y_8] : is_a_theorem(implies(Y_8,Y_8)),
inference(resolution,[status(thm)],[c_8,c_83]) ).
tff(c_13,plain,
! [Y_12,X_13] :
( is_a_theorem(Y_12)
| ~ is_a_theorem(X_13)
| ~ is_a_theorem(implies(X_13,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_21,plain,
! [X_7,Y_8] :
( is_a_theorem(implies(not(X_7),Y_8))
| ~ is_a_theorem(X_7) ),
inference(resolution,[status(thm)],[c_8,c_13]) ).
tff(c_27,plain,
! [Y_16,Z_17,X_15] :
( is_a_theorem(implies(implies(Y_16,Z_17),implies(X_15,Z_17)))
| ~ is_a_theorem(implies(X_15,Y_16)) ),
inference(resolution,[status(thm)],[c_23,c_2]) ).
tff(c_127,plain,
! [X_36,X_37,Z_38,Y_39] :
( is_a_theorem(implies(X_36,implies(X_37,Z_38)))
| ~ is_a_theorem(implies(X_36,implies(Y_39,Z_38)))
| ~ is_a_theorem(implies(X_37,Y_39)) ),
inference(resolution,[status(thm)],[c_27,c_45]) ).
tff(c_194,plain,
! [X_44,X_45,Y_46] :
( is_a_theorem(implies(X_44,implies(X_45,Y_46)))
| ~ is_a_theorem(implies(X_45,not(X_44))) ),
inference(resolution,[status(thm)],[c_8,c_127]) ).
tff(c_244,plain,
! [X_50,X_51,Y_52] :
( is_a_theorem(implies(X_50,implies(not(X_51),Y_52)))
| ~ is_a_theorem(X_51) ),
inference(resolution,[status(thm)],[c_21,c_194]) ).
tff(c_59,plain,
! [X_24,X_6] :
( is_a_theorem(implies(X_24,X_6))
| ~ is_a_theorem(implies(X_24,implies(not(X_6),X_6))) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_268,plain,
! [X_53,Y_54] :
( is_a_theorem(implies(X_53,Y_54))
| ~ is_a_theorem(Y_54) ),
inference(resolution,[status(thm)],[c_244,c_59]) ).
tff(c_10,plain,
~ is_a_theorem(implies(x,implies(y,y))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_295,plain,
~ is_a_theorem(implies(y,y)),
inference(resolution,[status(thm)],[c_268,c_10]) ).
tff(c_307,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_295]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL397-1 : TPTP v8.1.2. Released v2.3.0.
% 0.12/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.13/0.35 % Computer : n003.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:04:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.98/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/1.79
% 2.98/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.22/1.82
% 3.22/1.82 Inference rules
% 3.22/1.82 ----------------------
% 3.22/1.82 #Ref : 0
% 3.22/1.82 #Sup : 71
% 3.22/1.82 #Fact : 0
% 3.22/1.82 #Define : 0
% 3.22/1.82 #Split : 1
% 3.22/1.82 #Chain : 0
% 3.22/1.82 #Close : 0
% 3.22/1.82
% 3.22/1.82 Ordering : KBO
% 3.22/1.82
% 3.22/1.82 Simplification rules
% 3.22/1.82 ----------------------
% 3.22/1.82 #Subsume : 16
% 3.22/1.82 #Demod : 3
% 3.22/1.82 #Tautology : 8
% 3.22/1.82 #SimpNegUnit : 0
% 3.22/1.82 #BackRed : 0
% 3.22/1.82
% 3.22/1.82 #Partial instantiations: 0
% 3.22/1.82 #Strategies tried : 1
% 3.22/1.82
% 3.22/1.82 Timing (in seconds)
% 3.22/1.82 ----------------------
% 3.22/1.83 Preprocessing : 0.40
% 3.22/1.83 Parsing : 0.22
% 3.22/1.83 CNF conversion : 0.02
% 3.22/1.83 Main loop : 0.35
% 3.22/1.83 Inferencing : 0.15
% 3.22/1.83 Reduction : 0.08
% 3.22/1.83 Demodulation : 0.06
% 3.22/1.83 BG Simplification : 0.01
% 3.22/1.83 Subsumption : 0.08
% 3.22/1.83 Abstraction : 0.01
% 3.22/1.83 MUC search : 0.00
% 3.22/1.83 Cooper : 0.00
% 3.22/1.83 Total : 0.80
% 3.22/1.83 Index Insertion : 0.00
% 3.22/1.83 Index Deletion : 0.00
% 3.22/1.83 Index Matching : 0.00
% 3.22/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------