TSTP Solution File: LCL104-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL104-1 : TPTP v8.1.2. Released v1.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 : n017.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:47:22 EDT 2023
% Result : Unsatisfiable 11.66s 3.85s
% Output : CNFRefutation 11.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 16 unt; 6 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 93 (; 93 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > e > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(b,type,
b: $i ).
tff(equivalent,type,
equivalent: ( $i * $i ) > $i ).
tff(e,type,
e: $i ).
tff(c,type,
c: $i ).
tff(f_37,axiom,
! [X,Y,Z,U] : is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(Z,U)),X))),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_41,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file(unknown,unknown) ).
tff(c_16,plain,
! [X_18,Y_19,Z_20,U_21] : is_a_theorem(equivalent(X_18,equivalent(equivalent(equivalent(equivalent(Y_19,Z_20),equivalent(Y_19,U_21)),equivalent(Z_20,U_21)),X_18))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_10,plain,
! [X_12,Y_13,Z_14] : is_a_theorem(equivalent(equivalent(equivalent(X_12,Y_13),equivalent(equivalent(Y_13,X_12),Z_14)),Z_14)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(equivalent(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_14,plain,
! [Z_14,X_12,Y_13] :
( is_a_theorem(Z_14)
| ~ is_a_theorem(equivalent(equivalent(X_12,Y_13),equivalent(equivalent(Y_13,X_12),Z_14))) ),
inference(resolution,[status(thm)],[c_10,c_2]) ).
tff(c_24,plain,
! [Z_20,U_21,Y_19] : is_a_theorem(equivalent(equivalent(Z_20,U_21),equivalent(equivalent(Y_19,Z_20),equivalent(Y_19,U_21)))),
inference(resolution,[status(thm)],[c_16,c_14]) ).
tff(c_62,plain,
! [Y_32,Z_33,U_34,X_35] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(Y_32,Z_33),equivalent(Y_32,U_34)),equivalent(Z_33,U_34)),X_35))
| ~ is_a_theorem(X_35) ),
inference(resolution,[status(thm)],[c_16,c_2]) ).
tff(c_75,plain,
! [Z_36,Z_37,U_38,Y_39] :
( is_a_theorem(Z_36)
| ~ is_a_theorem(equivalent(equivalent(equivalent(Z_37,U_38),equivalent(equivalent(Y_39,Z_37),equivalent(Y_39,U_38))),Z_36)) ),
inference(resolution,[status(thm)],[c_62,c_14]) ).
tff(c_103,plain,
! [Y_40,Z_41,U_42,Y_43] : is_a_theorem(equivalent(equivalent(Y_40,equivalent(Z_41,U_42)),equivalent(Y_40,equivalent(equivalent(Y_43,Z_41),equivalent(Y_43,U_42))))),
inference(resolution,[status(thm)],[c_24,c_75]) ).
tff(c_73,plain,
! [Z_14,Z_33,U_34,Y_32] :
( is_a_theorem(Z_14)
| ~ is_a_theorem(equivalent(equivalent(equivalent(Z_33,U_34),equivalent(equivalent(Y_32,Z_33),equivalent(Y_32,U_34))),Z_14)) ),
inference(resolution,[status(thm)],[c_62,c_14]) ).
tff(c_143,plain,
! [Z_48,U_49,Y_50,Y_51] : is_a_theorem(equivalent(equivalent(Z_48,U_49),equivalent(equivalent(Y_50,equivalent(Y_51,Z_48)),equivalent(Y_50,equivalent(Y_51,U_49))))),
inference(resolution,[status(thm)],[c_103,c_73]) ).
tff(c_26,plain,
! [Z_22,U_23,Y_24] : is_a_theorem(equivalent(equivalent(Z_22,U_23),equivalent(equivalent(Y_24,Z_22),equivalent(Y_24,U_23)))),
inference(resolution,[status(thm)],[c_16,c_14]) ).
tff(c_35,plain,
! [Y_24,Z_22,U_23] :
( is_a_theorem(equivalent(equivalent(Y_24,Z_22),equivalent(Y_24,U_23)))
| ~ is_a_theorem(equivalent(Z_22,U_23)) ),
inference(resolution,[status(thm)],[c_26,c_2]) ).
tff(c_96,plain,
! [Z_37,U_38,U_23,Y_39] :
( is_a_theorem(equivalent(equivalent(Z_37,U_38),U_23))
| ~ is_a_theorem(equivalent(equivalent(equivalent(Y_39,Z_37),equivalent(Y_39,U_38)),U_23)) ),
inference(resolution,[status(thm)],[c_35,c_75]) ).
tff(c_157,plain,
! [Y_39,Y_50,Z_37,Y_51,U_38] : is_a_theorem(equivalent(equivalent(Z_37,U_38),equivalent(equivalent(Y_50,equivalent(Y_51,equivalent(Y_39,Z_37))),equivalent(Y_50,equivalent(Y_51,equivalent(Y_39,U_38)))))),
inference(resolution,[status(thm)],[c_143,c_96]) ).
tff(c_6,plain,
! [X_7,Y_8,Z_9] : is_a_theorem(equivalent(equivalent(equivalent(X_7,Y_8),equivalent(equivalent(Y_8,X_7),Z_9)),Z_9)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_41,plain,
! [Y_26,Z_27,U_28] :
( is_a_theorem(equivalent(equivalent(Y_26,Z_27),equivalent(Y_26,U_28)))
| ~ is_a_theorem(equivalent(Z_27,U_28)) ),
inference(resolution,[status(thm)],[c_26,c_2]) ).
tff(c_46,plain,
! [Y_29,U_30,Z_31] :
( is_a_theorem(equivalent(Y_29,U_30))
| ~ is_a_theorem(equivalent(Y_29,Z_31))
| ~ is_a_theorem(equivalent(Z_31,U_30)) ),
inference(resolution,[status(thm)],[c_41,c_2]) ).
tff(c_456,plain,
! [X_87,Y_88,Z_89,U_90] :
( is_a_theorem(equivalent(equivalent(equivalent(X_87,Y_88),equivalent(equivalent(Y_88,X_87),Z_89)),U_90))
| ~ is_a_theorem(equivalent(Z_89,U_90)) ),
inference(resolution,[status(thm)],[c_6,c_46]) ).
tff(c_893,plain,
! [Z_125,Z_126,Y_127,X_128] :
( is_a_theorem(Z_125)
| ~ is_a_theorem(equivalent(Z_126,equivalent(equivalent(equivalent(equivalent(Y_127,X_128),Z_126),equivalent(X_128,Y_127)),Z_125))) ),
inference(resolution,[status(thm)],[c_456,c_14]) ).
tff(c_942,plain,
! [Y_39,Z_37,Y_51,U_38] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(Y_39,Z_37),Y_51),equivalent(Z_37,U_38)),equivalent(Y_51,equivalent(Y_39,U_38)))),
inference(resolution,[status(thm)],[c_157,c_893]) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5,U_6] : is_a_theorem(equivalent(X_3,equivalent(equivalent(equivalent(equivalent(Y_4,Z_5),equivalent(Y_4,U_6)),equivalent(Z_5,U_6)),X_3))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2272,plain,
! [Z_213,X_212,U_211,Y_215,U_214] :
( is_a_theorem(equivalent(X_212,U_211))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(Y_215,Z_213),equivalent(Y_215,U_214)),equivalent(Z_213,U_214)),X_212),U_211)) ),
inference(resolution,[status(thm)],[c_4,c_46]) ).
tff(c_2350,plain,
! [Y_215,U_214,U_38,Z_213] : is_a_theorem(equivalent(equivalent(equivalent(Y_215,U_214),U_38),equivalent(equivalent(Z_213,U_214),equivalent(equivalent(Y_215,Z_213),U_38)))),
inference(resolution,[status(thm)],[c_942,c_2272]) ).
tff(c_8,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_20201,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2350,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL104-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:31:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.66/3.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.66/3.85
% 11.66/3.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.66/3.89
% 11.66/3.89 Inference rules
% 11.66/3.89 ----------------------
% 11.66/3.89 #Ref : 0
% 11.66/3.89 #Sup : 4326
% 11.66/3.89 #Fact : 0
% 11.66/3.89 #Define : 0
% 11.66/3.89 #Split : 3
% 11.66/3.89 #Chain : 0
% 11.66/3.89 #Close : 0
% 11.66/3.89
% 11.66/3.89 Ordering : KBO
% 11.66/3.89
% 11.66/3.89 Simplification rules
% 11.66/3.89 ----------------------
% 11.66/3.89 #Subsume : 765
% 11.66/3.89 #Demod : 1433
% 11.66/3.89 #Tautology : 1325
% 11.66/3.89 #SimpNegUnit : 0
% 11.66/3.89 #BackRed : 1
% 11.66/3.89
% 11.66/3.89 #Partial instantiations: 0
% 11.66/3.89 #Strategies tried : 1
% 11.66/3.89
% 11.66/3.89 Timing (in seconds)
% 11.66/3.89 ----------------------
% 11.66/3.90 Preprocessing : 0.39
% 11.66/3.90 Parsing : 0.21
% 11.66/3.90 CNF conversion : 0.02
% 11.66/3.90 Main loop : 2.43
% 11.66/3.90 Inferencing : 0.75
% 11.66/3.90 Reduction : 0.66
% 11.66/3.90 Demodulation : 0.54
% 11.66/3.90 BG Simplification : 0.05
% 11.66/3.90 Subsumption : 0.80
% 11.66/3.90 Abstraction : 0.06
% 11.66/3.90 MUC search : 0.00
% 11.66/3.90 Cooper : 0.00
% 11.66/3.90 Total : 2.88
% 11.66/3.90 Index Insertion : 0.00
% 11.66/3.90 Index Deletion : 0.00
% 11.66/3.90 Index Matching : 0.00
% 11.66/3.90 BG Taut test : 0.00
%------------------------------------------------------------------------------