TSTP Solution File: LCL097-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL097-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 : n006.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 6.35s 2.57s
% Output : CNFRefutation 6.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 68 (; 68 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > falsehood > 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(falsehood,type,
falsehood: $i ).
tff(b,type,
b: $i ).
tff(equivalent,type,
equivalent: ( $i * $i ) > $i ).
tff(e,type,
e: $i ).
tff(c,type,
c: $i ).
tff(f_41,axiom,
! [U,Z,X,Y,V] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
file(unknown,unknown) ).
tff(f_37,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,U] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
file(unknown,unknown) ).
tff(f_43,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file(unknown,unknown) ).
tff(c_6,plain,
! [U_7,Z_8,V_11,Y_10,X_9] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X_9,Y_10),equivalent(X_9,Z_8)),U_7),equivalent(equivalent(Y_10,Z_8),U_7)),V_11),V_11)),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_16,plain,
! [X_22,V_24,Y_26,U_25,Z_23] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X_22,Y_26),equivalent(X_22,Z_23)),U_25),equivalent(equivalent(Y_26,Z_23),U_25)),V_24),V_24)),
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_37]) ).
tff(c_21,plain,
! [Y_31,Z_28,U_29,V_30,X_27] :
( is_a_theorem(V_30)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X_27,Y_31),equivalent(X_27,Z_28)),U_29),equivalent(equivalent(Y_31,Z_28),U_29)),V_30)) ),
inference(resolution,[status(thm)],[c_16,c_2]) ).
tff(c_69,plain,
! [X_40,Z_41,Z_42,Y_43] : is_a_theorem(equivalent(equivalent(equivalent(X_40,Z_41),Z_42),equivalent(equivalent(Y_43,Z_41),equivalent(equivalent(X_40,Y_43),Z_42)))),
inference(resolution,[status(thm)],[c_6,c_21]) ).
tff(c_20,plain,
! [X_22,V_24,Y_26,U_25,Z_23] :
( is_a_theorem(V_24)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X_22,Y_26),equivalent(X_22,Z_23)),U_25),equivalent(equivalent(Y_26,Z_23),U_25)),V_24)) ),
inference(resolution,[status(thm)],[c_16,c_2]) ).
tff(c_509,plain,
! [X_93,Z_92,Y_95,Z_94,Y_96] : is_a_theorem(equivalent(equivalent(Y_95,Z_92),equivalent(equivalent(equivalent(equivalent(X_93,Y_96),equivalent(X_93,Z_94)),Y_95),equivalent(equivalent(Y_96,Z_94),Z_92)))),
inference(resolution,[status(thm)],[c_69,c_20]) ).
tff(c_4136,plain,
! [Z_246,U_250,X_245,X_248,Y_247,Z_249,Y_251] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_245,Y_247),equivalent(X_245,Z_246)),equivalent(equivalent(equivalent(X_248,Y_251),equivalent(X_248,Z_249)),U_250)),equivalent(equivalent(Y_247,Z_246),equivalent(equivalent(Y_251,Z_249),U_250)))),
inference(resolution,[status(thm)],[c_509,c_20]) ).
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_39]) ).
tff(c_32,plain,
! [Y_32,Z_33] : is_a_theorem(equivalent(equivalent(Y_32,Z_33),equivalent(Y_32,Z_33))),
inference(resolution,[status(thm)],[c_4,c_21]) ).
tff(c_145,plain,
! [X_49,Y_50,Z_51,U_52] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_49,Y_50),equivalent(X_49,Z_51)),U_52),equivalent(equivalent(Y_50,Z_51),U_52))),
inference(resolution,[status(thm)],[c_32,c_20]) ).
tff(c_161,plain,
! [Y_50,Z_51,U_52,X_49] :
( is_a_theorem(equivalent(equivalent(Y_50,Z_51),U_52))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X_49,Y_50),equivalent(X_49,Z_51)),U_52)) ),
inference(resolution,[status(thm)],[c_145,c_2]) ).
tff(c_4198,plain,
! [Z_246,U_250,X_248,Z_249,Y_251] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_248,Y_251),Z_246),U_250),equivalent(equivalent(equivalent(X_248,Z_249),Z_246),equivalent(equivalent(Y_251,Z_249),U_250)))),
inference(resolution,[status(thm)],[c_4136,c_161]) ).
tff(c_8,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_6983,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4198,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL097-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/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.36 % Computer : n006.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 14:01:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.35/2.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.35/2.57
% 6.35/2.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.51/2.61
% 6.51/2.61 Inference rules
% 6.51/2.61 ----------------------
% 6.51/2.61 #Ref : 0
% 6.51/2.61 #Sup : 1458
% 6.51/2.61 #Fact : 0
% 6.51/2.61 #Define : 0
% 6.51/2.61 #Split : 0
% 6.51/2.61 #Chain : 0
% 6.51/2.61 #Close : 0
% 6.51/2.61
% 6.51/2.61 Ordering : KBO
% 6.51/2.61
% 6.51/2.61 Simplification rules
% 6.51/2.61 ----------------------
% 6.51/2.61 #Subsume : 273
% 6.51/2.61 #Demod : 492
% 6.51/2.61 #Tautology : 493
% 6.51/2.61 #SimpNegUnit : 0
% 6.51/2.61 #BackRed : 1
% 6.51/2.61
% 6.51/2.61 #Partial instantiations: 0
% 6.51/2.61 #Strategies tried : 1
% 6.51/2.61
% 6.51/2.61 Timing (in seconds)
% 6.51/2.61 ----------------------
% 6.51/2.61 Preprocessing : 0.39
% 6.51/2.61 Parsing : 0.21
% 6.51/2.61 CNF conversion : 0.02
% 6.51/2.61 Main loop : 1.13
% 6.51/2.61 Inferencing : 0.40
% 6.51/2.61 Reduction : 0.32
% 6.51/2.61 Demodulation : 0.25
% 6.51/2.61 BG Simplification : 0.03
% 6.51/2.61 Subsumption : 0.29
% 6.51/2.61 Abstraction : 0.03
% 6.51/2.61 MUC search : 0.00
% 6.51/2.61 Cooper : 0.00
% 6.51/2.61 Total : 1.58
% 6.51/2.61 Index Insertion : 0.00
% 6.51/2.61 Index Deletion : 0.00
% 6.51/2.61 Index Matching : 0.00
% 6.51/2.61 BG Taut test : 0.00
%------------------------------------------------------------------------------