TSTP Solution File: LCL118-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL118-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 : n016.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:25 EDT 2023
% Result : Unsatisfiable 17.63s 9.24s
% Output : CNFRefutation 17.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 5 ( 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 : 77 (; 77 !; 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_34,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(Y,X)))),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_37,axiom,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
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(Y_4,X_3)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
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(Y_9,X_8)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
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_31]) ).
tff(c_13,plain,
! [Z_11,Y_12,X_13] :
( is_a_theorem(equivalent(Z_11,equivalent(Y_12,X_13)))
| ~ is_a_theorem(equivalent(X_13,equivalent(Y_12,Z_11))) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_16,plain,
! [Y_4,X_3,Z_5] : is_a_theorem(equivalent(equivalent(Y_4,X_3),equivalent(Z_5,equivalent(X_3,equivalent(Y_4,Z_5))))),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_17,plain,
! [Y_14,X_15,Z_16] : is_a_theorem(equivalent(equivalent(Y_14,X_15),equivalent(Z_16,equivalent(X_15,equivalent(Y_14,Z_16))))),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_26,plain,
! [Z_17,X_18,Y_19] :
( is_a_theorem(equivalent(Z_17,equivalent(X_18,equivalent(Y_19,Z_17))))
| ~ is_a_theorem(equivalent(Y_19,X_18)) ),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_12,plain,
! [Z_10,Y_9,X_8] :
( is_a_theorem(equivalent(Z_10,equivalent(Y_9,X_8)))
| ~ is_a_theorem(equivalent(X_8,equivalent(Y_9,Z_10))) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_34,plain,
! [Y_20,Z_21,X_22] :
( is_a_theorem(equivalent(equivalent(Y_20,Z_21),equivalent(X_22,Z_21)))
| ~ is_a_theorem(equivalent(Y_20,X_22)) ),
inference(resolution,[status(thm)],[c_26,c_12]) ).
tff(c_54,plain,
! [X_26,Z_27,Y_28] :
( is_a_theorem(equivalent(X_26,Z_27))
| ~ is_a_theorem(equivalent(Y_28,Z_27))
| ~ is_a_theorem(equivalent(Y_28,X_26)) ),
inference(resolution,[status(thm)],[c_34,c_2]) ).
tff(c_438,plain,
! [X_64,Z_65,Y_66,X_67] :
( is_a_theorem(equivalent(X_64,equivalent(Z_65,equivalent(Y_66,X_67))))
| ~ is_a_theorem(equivalent(equivalent(X_67,equivalent(Y_66,Z_65)),X_64)) ),
inference(resolution,[status(thm)],[c_4,c_54]) ).
tff(c_526,plain,
! [Z_71,Y_72,X_73] : is_a_theorem(equivalent(equivalent(Z_71,equivalent(Y_72,X_73)),equivalent(Z_71,equivalent(Y_72,X_73)))),
inference(resolution,[status(thm)],[c_4,c_438]) ).
tff(c_569,plain,
! [Y_77,X_78,Z_79] : is_a_theorem(equivalent(equivalent(Y_77,X_78),equivalent(Z_79,equivalent(Z_79,equivalent(Y_77,X_78))))),
inference(resolution,[status(thm)],[c_526,c_12]) ).
tff(c_591,plain,
! [Z_80,Y_81,X_82] :
( is_a_theorem(equivalent(Z_80,equivalent(Z_80,equivalent(Y_81,X_82))))
| ~ is_a_theorem(equivalent(Y_81,X_82)) ),
inference(resolution,[status(thm)],[c_569,c_2]) ).
tff(c_697,plain,
! [Y_91,X_92,Z_93] :
( is_a_theorem(equivalent(equivalent(Y_91,X_92),equivalent(Z_93,Z_93)))
| ~ is_a_theorem(equivalent(Y_91,X_92)) ),
inference(resolution,[status(thm)],[c_591,c_12]) ).
tff(c_720,plain,
! [Z_93,Y_91,X_92] :
( is_a_theorem(equivalent(Z_93,Z_93))
| ~ is_a_theorem(equivalent(Y_91,X_92)) ),
inference(resolution,[status(thm)],[c_697,c_2]) ).
tff(c_721,plain,
! [Y_91,X_92] : ~ is_a_theorem(equivalent(Y_91,X_92)),
inference(splitLeft,[status(thm)],[c_720]) ).
tff(c_542,plain,
! [Y_72,X_73,Z_71] : is_a_theorem(equivalent(equivalent(Y_72,X_73),equivalent(Z_71,equivalent(Z_71,equivalent(Y_72,X_73))))),
inference(resolution,[status(thm)],[c_526,c_12]) ).
tff(c_740,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_721,c_542]) ).
tff(c_781,plain,
! [Z_98] : is_a_theorem(equivalent(Z_98,Z_98)),
inference(splitRight,[status(thm)],[c_720]) ).
tff(c_41,plain,
! [X_22,Z_21,Y_20] :
( is_a_theorem(equivalent(X_22,Z_21))
| ~ is_a_theorem(equivalent(Y_20,Z_21))
| ~ is_a_theorem(equivalent(Y_20,X_22)) ),
inference(resolution,[status(thm)],[c_34,c_2]) ).
tff(c_820,plain,
! [X_99,Z_100] :
( is_a_theorem(equivalent(X_99,Z_100))
| ~ is_a_theorem(equivalent(Z_100,X_99)) ),
inference(resolution,[status(thm)],[c_781,c_41]) ).
tff(c_41505,plain,
! [Z_769,X_770,Y_771] : is_a_theorem(equivalent(equivalent(Z_769,equivalent(X_770,equivalent(Y_771,Z_769))),equivalent(Y_771,X_770))),
inference(resolution,[status(thm)],[c_16,c_820]) ).
tff(c_69,plain,
! [X_26,Z_5,Y_4,X_3] :
( is_a_theorem(equivalent(X_26,equivalent(Z_5,equivalent(Y_4,X_3))))
| ~ is_a_theorem(equivalent(equivalent(X_3,equivalent(Y_4,Z_5)),X_26)) ),
inference(resolution,[status(thm)],[c_4,c_54]) ).
tff(c_45194,plain,
! [Y_807,X_808,Z_809] : is_a_theorem(equivalent(equivalent(Y_807,X_808),equivalent(equivalent(Y_807,Z_809),equivalent(X_808,Z_809)))),
inference(resolution,[status(thm)],[c_41505,c_69]) ).
tff(c_45434,plain,
! [X_808,Z_809,Y_807] : is_a_theorem(equivalent(equivalent(X_808,Z_809),equivalent(equivalent(Y_807,Z_809),equivalent(Y_807,X_808)))),
inference(resolution,[status(thm)],[c_45194,c_12]) ).
tff(c_6,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_82051,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_45434,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL118-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/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.17/0.35 % Computer : n016.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 14:12:52 EDT 2023
% 0.17/0.35 % CPUTime :
% 17.63/9.24 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.63/9.25
% 17.63/9.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.85/9.29
% 17.85/9.29 Inference rules
% 17.85/9.29 ----------------------
% 17.85/9.29 #Ref : 0
% 17.85/9.29 #Sup : 17899
% 17.85/9.29 #Fact : 0
% 17.85/9.29 #Define : 0
% 17.85/9.29 #Split : 17
% 17.85/9.29 #Chain : 0
% 17.85/9.29 #Close : 0
% 17.85/9.29
% 17.85/9.29 Ordering : KBO
% 17.85/9.29
% 17.85/9.29 Simplification rules
% 17.85/9.29 ----------------------
% 17.85/9.29 #Subsume : 7795
% 17.85/9.29 #Demod : 2379
% 17.85/9.29 #Tautology : 793
% 17.85/9.29 #SimpNegUnit : 59
% 17.85/9.29 #BackRed : 18
% 17.85/9.29
% 17.85/9.29 #Partial instantiations: 0
% 17.85/9.29 #Strategies tried : 1
% 17.85/9.29
% 17.85/9.29 Timing (in seconds)
% 17.85/9.29 ----------------------
% 17.85/9.29 Preprocessing : 0.38
% 17.85/9.29 Parsing : 0.21
% 17.85/9.29 CNF conversion : 0.02
% 17.85/9.29 Main loop : 7.85
% 17.85/9.29 Inferencing : 1.39
% 17.85/9.29 Reduction : 1.41
% 17.85/9.29 Demodulation : 0.94
% 17.85/9.29 BG Simplification : 0.08
% 17.85/9.29 Subsumption : 4.53
% 17.85/9.29 Abstraction : 0.13
% 17.85/9.29 MUC search : 0.00
% 17.85/9.29 Cooper : 0.00
% 17.85/9.29 Total : 8.28
% 17.85/9.29 Index Insertion : 0.00
% 17.85/9.29 Index Deletion : 0.00
% 17.85/9.29 Index Matching : 0.00
% 17.85/9.29 BG Taut test : 0.00
%------------------------------------------------------------------------------