TSTP Solution File: LCL014-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL014-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 : n022.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:11 EDT 2023
% Result : Unsatisfiable 149.77s 123.48s
% Output : CNFRefutation 149.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 36 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 6 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 101 (; 101 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > 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(c,type,
c: $i ).
tff(f_35,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(X,Y)))),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_38,axiom,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5] : is_a_theorem(equivalent(equivalent(X_3,equivalent(Y_4,Z_5)),equivalent(Z_5,equivalent(X_3,Y_4)))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8,plain,
! [X_8,Y_9,Z_10] : is_a_theorem(equivalent(equivalent(X_8,equivalent(Y_9,Z_10)),equivalent(Z_10,equivalent(X_8,Y_9)))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
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_32]) ).
tff(c_13,plain,
! [Z_11,X_12,Y_13] :
( is_a_theorem(equivalent(Z_11,equivalent(X_12,Y_13)))
| ~ is_a_theorem(equivalent(X_12,equivalent(Y_13,Z_11))) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_17,plain,
! [X_14,Y_15,Z_16] : is_a_theorem(equivalent(equivalent(X_14,Y_15),equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),Z_16))),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_34,plain,
! [X_20,Y_21,Z_22] :
( is_a_theorem(equivalent(equivalent(X_20,equivalent(Y_21,Z_22)),Z_22))
| ~ is_a_theorem(equivalent(X_20,Y_21)) ),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_12,plain,
! [Z_10,X_8,Y_9] :
( is_a_theorem(equivalent(Z_10,equivalent(X_8,Y_9)))
| ~ is_a_theorem(equivalent(X_8,equivalent(Y_9,Z_10))) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_172,plain,
! [Z_46,X_47,Y_48,Y_49] :
( is_a_theorem(equivalent(Z_46,equivalent(equivalent(X_47,equivalent(Y_48,equivalent(Y_49,Z_46))),Y_49)))
| ~ is_a_theorem(equivalent(X_47,Y_48)) ),
inference(resolution,[status(thm)],[c_34,c_12]) ).
tff(c_1549,plain,
! [Y_118,Z_119,X_120,Y_121] :
( is_a_theorem(equivalent(Y_118,equivalent(Z_119,equivalent(X_120,equivalent(Y_121,equivalent(Y_118,Z_119))))))
| ~ is_a_theorem(equivalent(X_120,Y_121)) ),
inference(resolution,[status(thm)],[c_172,c_12]) ).
tff(c_16,plain,
! [X_3,Y_4,Z_5] : is_a_theorem(equivalent(equivalent(X_3,Y_4),equivalent(equivalent(X_3,equivalent(Y_4,Z_5)),Z_5))),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_51,plain,
! [Z_26,X_27,Y_28] :
( is_a_theorem(Z_26)
| ~ is_a_theorem(equivalent(X_27,equivalent(Y_28,Z_26)))
| ~ is_a_theorem(equivalent(X_27,Y_28)) ),
inference(resolution,[status(thm)],[c_34,c_2]) ).
tff(c_71,plain,
! [Z_5,X_3,Y_4] :
( is_a_theorem(Z_5)
| ~ is_a_theorem(equivalent(equivalent(X_3,Y_4),equivalent(X_3,equivalent(Y_4,Z_5)))) ),
inference(resolution,[status(thm)],[c_16,c_51]) ).
tff(c_2548,plain,
! [Y_156,Z_157,X_158] :
( is_a_theorem(equivalent(Y_156,equivalent(equivalent(Z_157,X_158),Z_157)))
| ~ is_a_theorem(equivalent(X_158,Y_156)) ),
inference(resolution,[status(thm)],[c_1549,c_71]) ).
tff(c_25,plain,
! [Z_17,X_18,Y_19] : is_a_theorem(equivalent(Z_17,equivalent(equivalent(X_18,Y_19),equivalent(X_18,equivalent(Y_19,Z_17))))),
inference(resolution,[status(thm)],[c_17,c_12]) ).
tff(c_43,plain,
! [X_23,Y_24,Z_25] :
( is_a_theorem(equivalent(equivalent(X_23,Y_24),equivalent(X_23,equivalent(Y_24,Z_25))))
| ~ is_a_theorem(Z_25) ),
inference(resolution,[status(thm)],[c_25,c_2]) ).
tff(c_122,plain,
! [Y_38,Z_39,X_40] :
( is_a_theorem(equivalent(equivalent(Y_38,Z_39),equivalent(equivalent(X_40,Y_38),X_40)))
| ~ is_a_theorem(Z_39) ),
inference(resolution,[status(thm)],[c_43,c_12]) ).
tff(c_42,plain,
! [Z_22,X_20,Y_21] :
( is_a_theorem(Z_22)
| ~ is_a_theorem(equivalent(X_20,equivalent(Y_21,Z_22)))
| ~ is_a_theorem(equivalent(X_20,Y_21)) ),
inference(resolution,[status(thm)],[c_34,c_2]) ).
tff(c_139,plain,
! [X_40,Y_38,Z_39] :
( is_a_theorem(X_40)
| ~ is_a_theorem(equivalent(equivalent(Y_38,Z_39),equivalent(X_40,Y_38)))
| ~ is_a_theorem(Z_39) ),
inference(resolution,[status(thm)],[c_122,c_42]) ).
tff(c_3878,plain,
! [Z_196,X_197,Z_198] :
( is_a_theorem(equivalent(Z_196,X_197))
| ~ is_a_theorem(Z_198)
| ~ is_a_theorem(equivalent(X_197,equivalent(Z_196,Z_198))) ),
inference(resolution,[status(thm)],[c_2548,c_139]) ).
tff(c_4069,plain,
! [Z_5,X_3,Y_4] :
( is_a_theorem(equivalent(Z_5,equivalent(X_3,equivalent(Y_4,Z_5))))
| ~ is_a_theorem(equivalent(X_3,Y_4)) ),
inference(resolution,[status(thm)],[c_4,c_3878]) ).
tff(c_72,plain,
! [X_3,Y_4,Z_5] :
( is_a_theorem(equivalent(X_3,Y_4))
| ~ is_a_theorem(equivalent(equivalent(X_3,equivalent(Y_4,Z_5)),Z_5)) ),
inference(resolution,[status(thm)],[c_4,c_51]) ).
tff(c_2282,plain,
! [Y_150,Y_151,X_152] :
( is_a_theorem(equivalent(Y_150,Y_151))
| ~ is_a_theorem(equivalent(Y_151,equivalent(equivalent(X_152,Y_150),X_152))) ),
inference(resolution,[status(thm)],[c_122,c_72]) ).
tff(c_2432,plain,
! [Y_150,X_3,Y_4] : is_a_theorem(equivalent(Y_150,equivalent(X_3,equivalent(Y_4,equivalent(equivalent(X_3,Y_4),Y_150))))),
inference(resolution,[status(thm)],[c_4,c_2282]) ).
tff(c_49,plain,
! [Y_24,Z_25,X_23] :
( is_a_theorem(equivalent(equivalent(Y_24,Z_25),equivalent(equivalent(X_23,Y_24),X_23)))
| ~ is_a_theorem(Z_25) ),
inference(resolution,[status(thm)],[c_43,c_12]) ).
tff(c_24,plain,
! [X_14,Y_15,Z_16] :
( is_a_theorem(equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),Z_16))
| ~ is_a_theorem(equivalent(X_14,Y_15)) ),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_687,plain,
! [Z_81,X_82,Y_83,Y_84] :
( is_a_theorem(Z_81)
| ~ is_a_theorem(equivalent(equivalent(X_82,equivalent(Y_83,equivalent(Y_84,Z_81))),Y_84))
| ~ is_a_theorem(equivalent(X_82,Y_83)) ),
inference(resolution,[status(thm)],[c_24,c_51]) ).
tff(c_9599,plain,
! [Z_316,Y_317,Y_318,X_319] :
( is_a_theorem(Z_316)
| ~ is_a_theorem(equivalent(Y_317,Y_318))
| ~ is_a_theorem(equivalent(Y_318,equivalent(equivalent(equivalent(X_319,Y_317),X_319),Z_316))) ),
inference(resolution,[status(thm)],[c_49,c_687]) ).
tff(c_10044,plain,
! [Y_323,Y_324,Z_325] :
( is_a_theorem(equivalent(Y_323,Y_324))
| ~ is_a_theorem(equivalent(Y_324,equivalent(Y_323,Z_325)))
| ~ is_a_theorem(Z_325) ),
inference(resolution,[status(thm)],[c_49,c_9599]) ).
tff(c_21418,plain,
! [X_482,Y_483,Y_484] :
( is_a_theorem(equivalent(X_482,Y_483))
| ~ is_a_theorem(equivalent(Y_484,equivalent(equivalent(X_482,Y_484),Y_483))) ),
inference(resolution,[status(thm)],[c_2432,c_10044]) ).
tff(c_510765,plain,
! [X_2901,Y_2902,Z_2903] :
( is_a_theorem(equivalent(X_2901,equivalent(Y_2902,Z_2903)))
| ~ is_a_theorem(equivalent(equivalent(X_2901,Z_2903),Y_2902)) ),
inference(resolution,[status(thm)],[c_4069,c_21418]) ).
tff(c_512136,plain,
! [X_3,Z_5,Y_4] : is_a_theorem(equivalent(X_3,equivalent(equivalent(Z_5,equivalent(X_3,Y_4)),equivalent(Y_4,Z_5)))),
inference(resolution,[status(thm)],[c_4,c_510765]) ).
tff(c_6,plain,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_513206,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_512136,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/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.09/0.32 % Computer : n022.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 300
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Thu Aug 3 13:40:33 EDT 2023
% 0.09/0.32 % CPUTime :
% 149.77/123.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 149.84/123.49
% 149.84/123.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 149.84/123.53
% 149.84/123.53 Inference rules
% 149.84/123.53 ----------------------
% 149.84/123.53 #Ref : 0
% 149.84/123.53 #Sup : 114174
% 149.84/123.53 #Fact : 0
% 149.84/123.53 #Define : 0
% 149.84/123.53 #Split : 10
% 149.84/123.53 #Chain : 0
% 149.84/123.53 #Close : 0
% 149.84/123.53
% 149.84/123.53 Ordering : KBO
% 149.84/123.53
% 149.84/123.53 Simplification rules
% 149.84/123.53 ----------------------
% 149.84/123.53 #Subsume : 32707
% 149.84/123.53 #Demod : 7846
% 149.84/123.53 #Tautology : 8839
% 149.84/123.53 #SimpNegUnit : 1210
% 149.84/123.53 #BackRed : 110
% 149.84/123.53
% 149.84/123.53 #Partial instantiations: 0
% 149.84/123.53 #Strategies tried : 1
% 149.84/123.53
% 149.84/123.53 Timing (in seconds)
% 149.84/123.53 ----------------------
% 149.84/123.53 Preprocessing : 0.48
% 149.84/123.53 Parsing : 0.27
% 149.84/123.53 CNF conversion : 0.02
% 149.84/123.53 Main loop : 121.94
% 149.84/123.53 Inferencing : 7.19
% 149.84/123.53 Reduction : 15.63
% 149.84/123.53 Demodulation : 12.75
% 149.84/123.54 BG Simplification : 0.44
% 149.84/123.54 Subsumption : 90.15
% 149.84/123.54 Abstraction : 0.68
% 149.84/123.54 MUC search : 0.00
% 149.84/123.54 Cooper : 0.00
% 149.84/123.54 Total : 122.48
% 149.84/123.54 Index Insertion : 0.00
% 149.84/123.54 Index Deletion : 0.00
% 149.84/123.54 Index Matching : 0.00
% 149.84/123.54 BG Taut test : 0.00
%------------------------------------------------------------------------------