TSTP Solution File: LCL102-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL102-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/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 : n024.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.57s 4.48s
% Output : CNFRefutation 11.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 17 unt; 6 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 91 (; 91 !; 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(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))),
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_39,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),X)))),
file(unknown,unknown) ).
tff(f_43,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5,U_6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X_3,Y_4),equivalent(X_3,Z_5)),equivalent(Y_4,Z_5)),U_6),U_6)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8,plain,
! [X_10,Y_11,Z_12] : is_a_theorem(equivalent(equivalent(X_10,Y_11),equivalent(equivalent(Z_12,X_10),equivalent(Z_12,Y_11)))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_12,plain,
! [X_15,Y_16,Z_17] : is_a_theorem(equivalent(equivalent(X_15,Y_16),equivalent(equivalent(Z_17,X_15),equivalent(Z_17,Y_16)))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
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_22,plain,
! [Z_21,X_22,Y_23] :
( is_a_theorem(equivalent(equivalent(Z_21,X_22),equivalent(Z_21,Y_23)))
| ~ is_a_theorem(equivalent(X_22,Y_23)) ),
inference(resolution,[status(thm)],[c_12,c_2]) ).
tff(c_37,plain,
! [Z_31,Y_32,X_33] :
( is_a_theorem(equivalent(Z_31,Y_32))
| ~ is_a_theorem(equivalent(Z_31,X_33))
| ~ is_a_theorem(equivalent(X_33,Y_32)) ),
inference(resolution,[status(thm)],[c_22,c_2]) ).
tff(c_927,plain,
! [X_110,Y_111,Y_112,Z_113] :
( is_a_theorem(equivalent(equivalent(X_110,Y_111),Y_112))
| ~ is_a_theorem(equivalent(equivalent(equivalent(Z_113,X_110),equivalent(Z_113,Y_111)),Y_112)) ),
inference(resolution,[status(thm)],[c_8,c_37]) ).
tff(c_2607,plain,
! [Y_175,Z_176,Y_177,X_178] : is_a_theorem(equivalent(equivalent(equivalent(Y_175,Z_176),Y_177),equivalent(equivalent(equivalent(X_178,Y_175),equivalent(X_178,Z_176)),Y_177))),
inference(resolution,[status(thm)],[c_4,c_927]) ).
tff(c_6,plain,
! [X_7,Y_8,Z_9] : is_a_theorem(equivalent(X_7,equivalent(equivalent(Y_8,Z_9),equivalent(equivalent(Z_9,Y_8),X_7)))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_51,plain,
! [X_7,Y_32,Y_8,Z_9] :
( is_a_theorem(equivalent(X_7,Y_32))
| ~ is_a_theorem(equivalent(equivalent(equivalent(Y_8,Z_9),equivalent(equivalent(Z_9,Y_8),X_7)),Y_32)) ),
inference(resolution,[status(thm)],[c_6,c_37]) ).
tff(c_21692,plain,
! [X_569,X_570,Y_571,Z_572] : is_a_theorem(equivalent(X_569,equivalent(equivalent(equivalent(X_570,Y_571),equivalent(X_570,Z_572)),equivalent(equivalent(Z_572,Y_571),X_569)))),
inference(resolution,[status(thm)],[c_2607,c_51]) ).
tff(c_17,plain,
! [X_18,Y_19,Z_20] : is_a_theorem(equivalent(X_18,equivalent(equivalent(Y_19,Z_20),equivalent(equivalent(Z_20,Y_19),X_18)))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_21,plain,
! [Y_19,Z_20,X_18] :
( is_a_theorem(equivalent(equivalent(Y_19,Z_20),equivalent(equivalent(Z_20,Y_19),X_18)))
| ~ is_a_theorem(X_18) ),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_32,plain,
! [X_27,Y_28,Z_29,U_30] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X_27,Y_28),equivalent(X_27,Z_29)),equivalent(Y_28,Z_29)),U_30),U_30)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_65,plain,
! [U_37,X_38,Y_39,Z_40] :
( is_a_theorem(U_37)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_38,Y_39),equivalent(X_38,Z_40)),equivalent(Y_39,Z_40)),U_37)) ),
inference(resolution,[status(thm)],[c_32,c_2]) ).
tff(c_89,plain,
! [Y_39,Z_40,X_38,X_18] :
( is_a_theorem(equivalent(equivalent(equivalent(Y_39,Z_40),equivalent(equivalent(X_38,Y_39),equivalent(X_38,Z_40))),X_18))
| ~ is_a_theorem(X_18) ),
inference(resolution,[status(thm)],[c_21,c_65]) ).
tff(c_111,plain,
! [Z_49,X_50,Y_51,Z_52] : is_a_theorem(equivalent(equivalent(Z_49,equivalent(equivalent(X_50,Y_51),equivalent(X_50,Z_52))),equivalent(Z_49,equivalent(Y_51,Z_52)))),
inference(resolution,[status(thm)],[c_8,c_65]) ).
tff(c_36,plain,
! [U_30,X_27,Y_28,Z_29] :
( is_a_theorem(U_30)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_27,Y_28),equivalent(X_27,Z_29)),equivalent(Y_28,Z_29)),U_30)) ),
inference(resolution,[status(thm)],[c_32,c_2]) ).
tff(c_1758,plain,
! [X_141,X_142,Y_143,Z_144] : is_a_theorem(equivalent(equivalent(equivalent(X_141,equivalent(X_142,Y_143)),equivalent(X_141,equivalent(X_142,Z_144))),equivalent(Y_143,Z_144))),
inference(resolution,[status(thm)],[c_111,c_36]) ).
tff(c_2750,plain,
! [Y_183,Z_184,X_185,X_186] :
( is_a_theorem(equivalent(Y_183,Z_184))
| ~ is_a_theorem(equivalent(equivalent(X_185,equivalent(X_186,Y_183)),equivalent(X_185,equivalent(X_186,Z_184)))) ),
inference(resolution,[status(thm)],[c_1758,c_2]) ).
tff(c_2852,plain,
! [X_38,Z_40,Z_184,Y_39] :
( is_a_theorem(equivalent(equivalent(X_38,Z_40),Z_184))
| ~ is_a_theorem(equivalent(equivalent(Y_39,Z_40),equivalent(equivalent(X_38,Y_39),Z_184))) ),
inference(resolution,[status(thm)],[c_89,c_2750]) ).
tff(c_21884,plain,
! [X_570,Y_571,Z_40,Z_572] : is_a_theorem(equivalent(equivalent(equivalent(X_570,Y_571),Z_40),equivalent(equivalent(Z_572,Y_571),equivalent(equivalent(X_570,Z_572),Z_40)))),
inference(resolution,[status(thm)],[c_21692,c_2852]) ).
tff(c_10,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_27743,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_21884,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL102-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:13:00 EDT 2023
% 0.14/0.35 % CPUTime :
% 11.57/4.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.57/4.49
% 11.57/4.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.57/4.53
% 11.57/4.53 Inference rules
% 11.57/4.53 ----------------------
% 11.57/4.53 #Ref : 0
% 11.57/4.53 #Sup : 6163
% 11.57/4.53 #Fact : 0
% 11.57/4.53 #Define : 0
% 11.57/4.53 #Split : 3
% 11.57/4.53 #Chain : 0
% 11.57/4.53 #Close : 0
% 11.57/4.53
% 11.57/4.53 Ordering : KBO
% 11.57/4.53
% 11.57/4.53 Simplification rules
% 11.57/4.53 ----------------------
% 11.57/4.53 #Subsume : 1238
% 11.57/4.53 #Demod : 1515
% 11.57/4.53 #Tautology : 1364
% 11.57/4.53 #SimpNegUnit : 0
% 11.57/4.53 #BackRed : 1
% 11.57/4.53
% 11.57/4.53 #Partial instantiations: 0
% 11.57/4.53 #Strategies tried : 1
% 11.57/4.53
% 11.57/4.53 Timing (in seconds)
% 11.57/4.53 ----------------------
% 11.57/4.53 Preprocessing : 0.39
% 11.57/4.53 Parsing : 0.21
% 11.57/4.53 CNF conversion : 0.02
% 11.57/4.53 Main loop : 3.00
% 11.57/4.53 Inferencing : 0.74
% 11.57/4.53 Reduction : 0.89
% 11.57/4.53 Demodulation : 0.76
% 11.57/4.53 BG Simplification : 0.05
% 11.57/4.53 Subsumption : 1.14
% 11.57/4.53 Abstraction : 0.06
% 11.57/4.53 MUC search : 0.00
% 11.57/4.53 Cooper : 0.00
% 11.57/4.53 Total : 3.44
% 11.57/4.53 Index Insertion : 0.00
% 11.57/4.53 Index Deletion : 0.00
% 11.57/4.53 Index Matching : 0.00
% 11.57/4.53 BG Taut test : 0.00
%------------------------------------------------------------------------------