TSTP Solution File: LCL075-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL075-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 : n029.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:18 EDT 2023
% Result : Unsatisfiable 9.86s 3.52s
% Output : CNFRefutation 10.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 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 : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 68 (; 68 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > 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(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_38,axiom,
! [U,Z,X,Y,V] : is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(not(Z),not(U))),Z),V),implies(implies(V,X),implies(U,X)))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_40,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
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(not(Z_4),not(U_3))),Z_4),V_7),implies(implies(V_7,X_5),implies(U_3,X_5)))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
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(not(Z_11),not(U_13))),Z_11),V_10),implies(implies(V_10,X_14),implies(U_13,X_14)))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
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_36]) ).
tff(c_13,plain,
! [Y_16,V_18,U_15,Z_19,X_17] :
( is_a_theorem(implies(implies(V_18,X_17),implies(U_15,X_17)))
| ~ is_a_theorem(implies(implies(implies(implies(X_17,Y_16),implies(not(Z_19),not(U_15))),Z_19),V_18)) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_18,plain,
! [Y_22,V_20,U_21,U_23,X_24] : is_a_theorem(implies(implies(implies(implies(V_20,X_24),implies(U_23,X_24)),implies(X_24,Y_22)),implies(U_21,implies(X_24,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(U_13,X_14)))
| ~ is_a_theorem(implies(implies(implies(implies(X_14,Y_12),implies(not(Z_11),not(U_13))),Z_11),V_10)) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_27,plain,
! [U_25,U_26,Y_27,V_28] : is_a_theorem(implies(implies(implies(U_25,implies(not(U_26),Y_27)),V_28),implies(U_26,V_28))),
inference(resolution,[status(thm)],[c_18,c_12]) ).
tff(c_34,plain,
! [V_28,X_14,U_13] : is_a_theorem(implies(implies(implies(V_28,V_28),X_14),implies(U_13,X_14))),
inference(resolution,[status(thm)],[c_27,c_12]) ).
tff(c_36,plain,
! [V_29,X_30,U_31] : is_a_theorem(implies(implies(implies(V_29,V_29),X_30),implies(U_31,X_30))),
inference(resolution,[status(thm)],[c_27,c_12]) ).
tff(c_45,plain,
! [U_32,X_33,V_34] :
( is_a_theorem(implies(U_32,X_33))
| ~ is_a_theorem(implies(implies(V_34,V_34),X_33)) ),
inference(resolution,[status(thm)],[c_36,c_2]) ).
tff(c_58,plain,
! [U_35,U_36,V_37] : is_a_theorem(implies(U_35,implies(U_36,implies(V_37,V_37)))),
inference(resolution,[status(thm)],[c_34,c_45]) ).
tff(c_972,plain,
! [U_135,V_136,X_137,U_138] : is_a_theorem(implies(implies(implies(U_135,implies(V_136,V_136)),X_137),implies(U_138,X_137))),
inference(resolution,[status(thm)],[c_58,c_12]) ).
tff(c_1002,plain,
! [U_138,X_137,X_14] : is_a_theorem(implies(implies(implies(U_138,X_137),X_14),implies(X_137,X_14))),
inference(resolution,[status(thm)],[c_972,c_12]) ).
tff(c_1004,plain,
! [U_139,X_140,X_141] : is_a_theorem(implies(implies(implies(U_139,X_140),X_141),implies(X_140,X_141))),
inference(resolution,[status(thm)],[c_972,c_12]) ).
tff(c_6043,plain,
! [X_441,U_442,X_443] : is_a_theorem(implies(implies(implies(implies(not(X_441),not(U_442)),X_441),X_443),implies(U_442,X_443))),
inference(resolution,[status(thm)],[c_1004,c_12]) ).
tff(c_16202,plain,
! [U_742,X_743,X_744] :
( is_a_theorem(implies(U_742,X_743))
| ~ is_a_theorem(implies(implies(implies(not(X_744),not(U_742)),X_744),X_743)) ),
inference(resolution,[status(thm)],[c_6043,c_2]) ).
tff(c_16701,plain,
! [U_742,X_14] : is_a_theorem(implies(U_742,implies(not(U_742),X_14))),
inference(resolution,[status(thm)],[c_1002,c_16202]) ).
tff(c_6,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_16736,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16701,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/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.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 14:08:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 9.86/3.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.86/3.53
% 9.86/3.53 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.09/3.56
% 10.09/3.56 Inference rules
% 10.09/3.56 ----------------------
% 10.09/3.56 #Ref : 0
% 10.09/3.56 #Sup : 2865
% 10.09/3.56 #Fact : 0
% 10.09/3.56 #Define : 0
% 10.09/3.56 #Split : 49
% 10.09/3.56 #Chain : 0
% 10.09/3.56 #Close : 0
% 10.09/3.56
% 10.09/3.56 Ordering : KBO
% 10.09/3.56
% 10.09/3.56 Simplification rules
% 10.09/3.56 ----------------------
% 10.09/3.56 #Subsume : 2403
% 10.09/3.56 #Demod : 1251
% 10.09/3.56 #Tautology : 1256
% 10.09/3.56 #SimpNegUnit : 3439
% 10.09/3.56 #BackRed : 2064
% 10.09/3.56
% 10.09/3.56 #Partial instantiations: 0
% 10.09/3.56 #Strategies tried : 1
% 10.09/3.56
% 10.09/3.56 Timing (in seconds)
% 10.09/3.56 ----------------------
% 10.09/3.57 Preprocessing : 0.38
% 10.09/3.57 Parsing : 0.21
% 10.09/3.57 CNF conversion : 0.02
% 10.09/3.57 Main loop : 2.02
% 10.09/3.57 Inferencing : 0.60
% 10.09/3.57 Reduction : 0.71
% 10.09/3.57 Demodulation : 0.55
% 10.09/3.57 BG Simplification : 0.03
% 10.09/3.57 Subsumption : 0.55
% 10.09/3.57 Abstraction : 0.05
% 10.09/3.57 MUC search : 0.00
% 10.09/3.57 Cooper : 0.00
% 10.09/3.57 Total : 2.46
% 10.09/3.57 Index Insertion : 0.00
% 10.09/3.57 Index Deletion : 0.00
% 10.09/3.57 Index Matching : 0.00
% 10.09/3.57 BG Taut test : 0.00
%------------------------------------------------------------------------------