TSTP Solution File: LCL035-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL035-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 : n032.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:13 EDT 2023
% Result : Unsatisfiable 2.52s 1.58s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 25 unt; 4 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 85 (; 85 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > falsehood > 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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_37,axiom,
! [U,Z,X,Y,V] : is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_39,axiom,
~ is_a_theorem(implies(falsehood,a)),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_7,Z_4,Y_6,U_3,X_5] : is_a_theorem(implies(implies(implies(implies(implies(X_5,Y_6),implies(Z_4,falsehood)),U_3),V_7),implies(implies(V_7,X_5),implies(Z_4,X_5)))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8,plain,
! [U_13,X_14,Y_12,V_10,Z_11] : is_a_theorem(implies(implies(implies(implies(implies(X_14,Y_12),implies(Z_11,falsehood)),U_13),V_10),implies(implies(V_10,X_14),implies(Z_11,X_14)))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_13,plain,
! [Y_16,V_18,U_15,Z_19,X_17] :
( is_a_theorem(implies(implies(V_18,X_17),implies(Z_19,X_17)))
| ~ is_a_theorem(implies(implies(implies(implies(X_17,Y_16),implies(Z_19,falsehood)),U_15),V_18)) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_18,plain,
! [Z_21,Z_24,Y_22,V_20,X_23] : is_a_theorem(implies(implies(implies(implies(V_20,X_23),implies(Z_21,X_23)),implies(X_23,Y_22)),implies(Z_24,implies(X_23,Y_22)))),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_12,plain,
! [U_13,X_14,Y_12,V_10,Z_11] :
( is_a_theorem(implies(implies(V_10,X_14),implies(Z_11,X_14)))
| ~ is_a_theorem(implies(implies(implies(implies(X_14,Y_12),implies(Z_11,falsehood)),U_13),V_10)) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_27,plain,
! [Z_25,Y_26,V_27,Z_28] : is_a_theorem(implies(implies(implies(Z_25,implies(falsehood,Y_26)),V_27),implies(Z_28,V_27))),
inference(resolution,[status(thm)],[c_18,c_12]) ).
tff(c_36,plain,
! [Z_29,V_30,X_31] : is_a_theorem(implies(implies(implies(Z_29,V_30),X_31),implies(falsehood,X_31))),
inference(resolution,[status(thm)],[c_27,c_12]) ).
tff(c_43,plain,
! [X_31,X_14,Z_11] : is_a_theorem(implies(implies(implies(falsehood,X_31),X_14),implies(Z_11,X_14))),
inference(resolution,[status(thm)],[c_36,c_12]) ).
tff(c_80,plain,
! [Z_43,V_47,X_46,Y_45,Z_44] :
( is_a_theorem(implies(Z_44,implies(X_46,Y_45)))
| ~ is_a_theorem(implies(implies(implies(V_47,X_46),implies(Z_43,X_46)),implies(X_46,Y_45))) ),
inference(resolution,[status(thm)],[c_18,c_2]) ).
tff(c_126,plain,
! [Z_50,Z_51,Z_52] : is_a_theorem(implies(Z_50,implies(Z_51,implies(Z_52,Z_51)))),
inference(resolution,[status(thm)],[c_43,c_80]) ).
tff(c_150,plain,
! [Z_51,Z_52,Z_50] :
( is_a_theorem(implies(Z_51,implies(Z_52,Z_51)))
| ~ is_a_theorem(Z_50) ),
inference(resolution,[status(thm)],[c_126,c_2]) ).
tff(c_151,plain,
! [Z_50] : ~ is_a_theorem(Z_50),
inference(splitLeft,[status(thm)],[c_150]) ).
tff(c_93,plain,
! [Z_44,Z_11,Z_43] : is_a_theorem(implies(Z_44,implies(Z_11,implies(Z_43,Z_11)))),
inference(resolution,[status(thm)],[c_43,c_80]) ).
tff(c_164,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_151,c_93]) ).
tff(c_166,plain,
! [Z_53,Z_54] : is_a_theorem(implies(Z_53,implies(Z_54,Z_53))),
inference(splitRight,[status(thm)],[c_150]) ).
tff(c_45,plain,
! [X_32,X_33,Z_34] : is_a_theorem(implies(implies(implies(falsehood,X_32),X_33),implies(Z_34,X_33))),
inference(resolution,[status(thm)],[c_36,c_12]) ).
tff(c_49,plain,
! [Z_34,X_33,X_32] :
( is_a_theorem(implies(Z_34,X_33))
| ~ is_a_theorem(implies(implies(falsehood,X_32),X_33)) ),
inference(resolution,[status(thm)],[c_45,c_2]) ).
tff(c_215,plain,
! [Z_57,Z_58,X_59] : is_a_theorem(implies(Z_57,implies(Z_58,implies(falsehood,X_59)))),
inference(resolution,[status(thm)],[c_166,c_49]) ).
tff(c_240,plain,
! [Z_58,X_59,Z_57] :
( is_a_theorem(implies(Z_58,implies(falsehood,X_59)))
| ~ is_a_theorem(Z_57) ),
inference(resolution,[status(thm)],[c_215,c_2]) ).
tff(c_242,plain,
! [Z_57] : ~ is_a_theorem(Z_57),
inference(splitLeft,[status(thm)],[c_240]) ).
tff(c_184,plain,
! [Z_34,Z_54,X_32] : is_a_theorem(implies(Z_34,implies(Z_54,implies(falsehood,X_32)))),
inference(resolution,[status(thm)],[c_166,c_49]) ).
tff(c_258,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_242,c_184]) ).
tff(c_261,plain,
! [Z_60,X_61] : is_a_theorem(implies(Z_60,implies(falsehood,X_61))),
inference(splitRight,[status(thm)],[c_240]) ).
tff(c_286,plain,
! [X_61,Z_60] :
( is_a_theorem(implies(falsehood,X_61))
| ~ is_a_theorem(Z_60) ),
inference(resolution,[status(thm)],[c_261,c_2]) ).
tff(c_287,plain,
! [Z_60] : ~ is_a_theorem(Z_60),
inference(splitLeft,[status(thm)],[c_286]) ).
tff(c_259,plain,
! [Z_58,X_59] : is_a_theorem(implies(Z_58,implies(falsehood,X_59))),
inference(splitRight,[status(thm)],[c_240]) ).
tff(c_303,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_287,c_259]) ).
tff(c_304,plain,
! [X_61] : is_a_theorem(implies(falsehood,X_61)),
inference(splitRight,[status(thm)],[c_286]) ).
tff(c_6,plain,
~ is_a_theorem(implies(falsehood,a)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_309,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_304,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Thu Aug 3 13:26:06 EDT 2023
% 0.11/0.30 % CPUTime :
% 2.52/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.60/1.59
% 2.60/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.60/1.63
% 2.60/1.63 Inference rules
% 2.60/1.63 ----------------------
% 2.60/1.63 #Ref : 0
% 2.60/1.63 #Sup : 50
% 2.60/1.63 #Fact : 0
% 2.60/1.63 #Define : 0
% 2.60/1.63 #Split : 4
% 2.60/1.63 #Chain : 0
% 2.60/1.63 #Close : 0
% 2.60/1.63
% 2.60/1.63 Ordering : KBO
% 2.60/1.63
% 2.60/1.63 Simplification rules
% 2.60/1.63 ----------------------
% 2.60/1.63 #Subsume : 28
% 2.60/1.63 #Demod : 26
% 2.60/1.63 #Tautology : 26
% 2.60/1.63 #SimpNegUnit : 42
% 2.60/1.63 #BackRed : 26
% 2.60/1.63
% 2.60/1.63 #Partial instantiations: 0
% 2.60/1.63 #Strategies tried : 1
% 2.60/1.63
% 2.60/1.63 Timing (in seconds)
% 2.60/1.63 ----------------------
% 2.70/1.63 Preprocessing : 0.38
% 2.70/1.63 Parsing : 0.21
% 2.70/1.63 CNF conversion : 0.02
% 2.70/1.63 Main loop : 0.32
% 2.70/1.63 Inferencing : 0.13
% 2.70/1.63 Reduction : 0.09
% 2.70/1.63 Demodulation : 0.06
% 2.70/1.63 BG Simplification : 0.01
% 2.70/1.63 Subsumption : 0.06
% 2.70/1.63 Abstraction : 0.01
% 2.70/1.63 MUC search : 0.00
% 2.70/1.63 Cooper : 0.00
% 2.70/1.63 Total : 0.75
% 2.70/1.63 Index Insertion : 0.00
% 2.70/1.63 Index Deletion : 0.00
% 2.70/1.63 Index Matching : 0.00
% 2.70/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------