TSTP Solution File: LCL101-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL101-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 : 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:47:22 EDT 2023
% Result : Unsatisfiable 8.85s 3.15s
% Output : CNFRefutation 8.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 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 : 83 (; 83 !; 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_39,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_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_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_6,plain,
! [X_7,Y_8,Z_9,U_10] : is_a_theorem(equivalent(X_7,equivalent(equivalent(equivalent(equivalent(Y_8,Z_9),equivalent(Y_8,U_10)),equivalent(Z_9,U_10)),X_7))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
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_10,plain,
! [X_13,Y_14,Z_15,U_16] : is_a_theorem(equivalent(X_13,equivalent(equivalent(equivalent(equivalent(Y_14,Z_15),equivalent(Y_14,U_16)),equivalent(Z_15,U_16)),X_13))),
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,
! [Y_14,Z_15,U_16,X_13] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(Y_14,Z_15),equivalent(Y_14,U_16)),equivalent(Z_15,U_16)),X_13))
| ~ is_a_theorem(X_13) ),
inference(resolution,[status(thm)],[c_10,c_2]) ).
tff(c_15,plain,
! [X_17,Y_18,Z_19,U_20] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X_17,Y_18),equivalent(X_17,Z_19)),equivalent(Y_18,Z_19)),U_20),U_20)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_20,plain,
! [U_21,X_22,Y_23,Z_24] :
( is_a_theorem(U_21)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_22,Y_23),equivalent(X_22,Z_24)),equivalent(Y_23,Z_24)),U_21)) ),
inference(resolution,[status(thm)],[c_15,c_2]) ).
tff(c_35,plain,
! [U_34,X_33,Y_31,Y_32,Z_29,Z_30] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(Y_31,Z_29),equivalent(Y_31,U_34)),equivalent(Z_29,U_34)),equivalent(equivalent(equivalent(X_33,Y_32),equivalent(X_33,Z_30)),equivalent(Y_32,Z_30)))),
inference(resolution,[status(thm)],[c_6,c_20]) ).
tff(c_19,plain,
! [U_20,X_17,Y_18,Z_19] :
( is_a_theorem(U_20)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_17,Y_18),equivalent(X_17,Z_19)),equivalent(Y_18,Z_19)),U_20)) ),
inference(resolution,[status(thm)],[c_15,c_2]) ).
tff(c_44,plain,
! [X_35,Y_36,Z_37] : is_a_theorem(equivalent(equivalent(equivalent(X_35,Y_36),equivalent(X_35,Z_37)),equivalent(Y_36,Z_37))),
inference(resolution,[status(thm)],[c_35,c_19]) ).
tff(c_49,plain,
! [Y_38,Z_39,X_40] :
( is_a_theorem(equivalent(Y_38,Z_39))
| ~ is_a_theorem(equivalent(equivalent(X_40,Y_38),equivalent(X_40,Z_39))) ),
inference(resolution,[status(thm)],[c_44,c_2]) ).
tff(c_107,plain,
! [Z_44,U_45,Z_46,Y_47] :
( is_a_theorem(equivalent(equivalent(Z_44,U_45),Z_46))
| ~ is_a_theorem(equivalent(equivalent(equivalent(Y_47,Z_44),equivalent(Y_47,U_45)),Z_46)) ),
inference(resolution,[status(thm)],[c_14,c_49]) ).
tff(c_162,plain,
! [Y_54,Z_55,U_56,X_57] : is_a_theorem(equivalent(equivalent(equivalent(Y_54,Z_55),U_56),equivalent(equivalent(equivalent(X_57,Y_54),equivalent(X_57,Z_55)),U_56))),
inference(resolution,[status(thm)],[c_4,c_107]) ).
tff(c_218,plain,
! [X_65,Y_66,Z_67,U_68] :
( is_a_theorem(equivalent(equivalent(equivalent(X_65,Y_66),equivalent(X_65,Z_67)),U_68))
| ~ is_a_theorem(equivalent(equivalent(Y_66,Z_67),U_68)) ),
inference(resolution,[status(thm)],[c_162,c_2]) ).
tff(c_48,plain,
! [Y_36,Z_37,X_35] :
( is_a_theorem(equivalent(Y_36,Z_37))
| ~ is_a_theorem(equivalent(equivalent(X_35,Y_36),equivalent(X_35,Z_37))) ),
inference(resolution,[status(thm)],[c_44,c_2]) ).
tff(c_634,plain,
! [X_108,Z_109,Z_110,Y_111] :
( is_a_theorem(equivalent(equivalent(X_108,Z_109),Z_110))
| ~ is_a_theorem(equivalent(equivalent(Y_111,Z_109),equivalent(equivalent(X_108,Y_111),Z_110))) ),
inference(resolution,[status(thm)],[c_218,c_48]) ).
tff(c_1838,plain,
! [Y_171,Z_172,U_173,Z_174] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(Y_171,Z_172),equivalent(Y_171,U_173)),Z_174),equivalent(equivalent(Z_172,U_173),Z_174))),
inference(resolution,[status(thm)],[c_6,c_634]) ).
tff(c_67,plain,
! [Z_15,U_16,Z_39,Y_14] :
( is_a_theorem(equivalent(equivalent(Z_15,U_16),Z_39))
| ~ is_a_theorem(equivalent(equivalent(equivalent(Y_14,Z_15),equivalent(Y_14,U_16)),Z_39)) ),
inference(resolution,[status(thm)],[c_14,c_49]) ).
tff(c_1890,plain,
! [Y_171,U_173,U_16,Z_172] : is_a_theorem(equivalent(equivalent(equivalent(Y_171,U_173),U_16),equivalent(equivalent(Z_172,U_173),equivalent(equivalent(Y_171,Z_172),U_16)))),
inference(resolution,[status(thm)],[c_1838,c_67]) ).
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_13343,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1890,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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 : n003.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 13:38:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.85/3.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.85/3.16
% 8.85/3.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.85/3.20
% 8.85/3.20 Inference rules
% 8.85/3.20 ----------------------
% 8.85/3.20 #Ref : 0
% 8.85/3.20 #Sup : 2719
% 8.85/3.20 #Fact : 0
% 8.85/3.20 #Define : 0
% 8.85/3.20 #Split : 1
% 8.85/3.20 #Chain : 0
% 8.85/3.20 #Close : 0
% 8.85/3.20
% 8.85/3.20 Ordering : KBO
% 8.85/3.20
% 8.85/3.20 Simplification rules
% 8.85/3.20 ----------------------
% 8.85/3.20 #Subsume : 486
% 8.85/3.20 #Demod : 1053
% 8.85/3.20 #Tautology : 993
% 8.85/3.20 #SimpNegUnit : 0
% 8.85/3.20 #BackRed : 1
% 8.85/3.20
% 8.85/3.20 #Partial instantiations: 0
% 8.85/3.20 #Strategies tried : 1
% 8.85/3.20
% 8.85/3.20 Timing (in seconds)
% 8.85/3.20 ----------------------
% 8.85/3.20 Preprocessing : 0.39
% 8.85/3.20 Parsing : 0.22
% 8.85/3.20 CNF conversion : 0.02
% 8.85/3.20 Main loop : 1.72
% 8.85/3.20 Inferencing : 0.58
% 8.85/3.20 Reduction : 0.53
% 8.85/3.20 Demodulation : 0.44
% 8.85/3.20 BG Simplification : 0.04
% 8.85/3.20 Subsumption : 0.46
% 9.02/3.20 Abstraction : 0.04
% 9.02/3.20 MUC search : 0.00
% 9.02/3.20 Cooper : 0.00
% 9.02/3.20 Total : 2.17
% 9.02/3.20 Index Insertion : 0.00
% 9.02/3.20 Index Deletion : 0.00
% 9.02/3.20 Index Matching : 0.00
% 9.02/3.20 BG Taut test : 0.00
%------------------------------------------------------------------------------