TSTP Solution File: LCL069-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n031.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:17 EDT 2023
% Result : Unsatisfiable 9.33s 3.29s
% Output : CNFRefutation 9.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 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 : 72 (; 72 !; 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_39,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X,Z,Y] : is_a_theorem(implies(implies(not(X),Z),implies(implies(Y,Z),implies(implies(X,Y),Z)))),
file(unknown,unknown) ).
tff(f_45,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5] : is_a_theorem(implies(implies(implies(X_3,Y_4),Z_5),implies(Y_4,Z_5))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
! [X_14,Y_15,Z_16] : is_a_theorem(implies(implies(implies(X_14,Y_15),Z_16),implies(Y_15,Z_16))),
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(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_17,plain,
! [Y_17,Z_18,X_19] :
( is_a_theorem(implies(Y_17,Z_18))
| ~ is_a_theorem(implies(implies(X_19,Y_17),Z_18)) ),
inference(resolution,[status(thm)],[c_12,c_2]) ).
tff(c_22,plain,
! [Z_20,Y_21] : is_a_theorem(implies(Z_20,implies(Y_21,Z_20))),
inference(resolution,[status(thm)],[c_4,c_17]) ).
tff(c_16,plain,
! [Y_15,Z_16,X_14] :
( is_a_theorem(implies(Y_15,Z_16))
| ~ is_a_theorem(implies(implies(X_14,Y_15),Z_16)) ),
inference(resolution,[status(thm)],[c_12,c_2]) ).
tff(c_30,plain,
! [Y_15,Y_21,X_14] : is_a_theorem(implies(Y_15,implies(Y_21,implies(X_14,Y_15)))),
inference(resolution,[status(thm)],[c_22,c_16]) ).
tff(c_32,plain,
! [X_22,Y_23,Z_24] : is_a_theorem(implies(implies(implies(X_22,Y_23),Z_24),implies(not(X_22),Z_24))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_113,plain,
! [X_44,Z_45,Y_46] :
( is_a_theorem(implies(not(X_44),Z_45))
| ~ is_a_theorem(implies(implies(X_44,Y_46),Z_45)) ),
inference(resolution,[status(thm)],[c_32,c_2]) ).
tff(c_150,plain,
! [X_44,Y_21,X_14,Y_46] : is_a_theorem(implies(not(X_44),implies(Y_21,implies(X_14,implies(X_44,Y_46))))),
inference(resolution,[status(thm)],[c_30,c_113]) ).
tff(c_21,plain,
! [Z_5,Y_4] : is_a_theorem(implies(Z_5,implies(Y_4,Z_5))),
inference(resolution,[status(thm)],[c_4,c_17]) ).
tff(c_154,plain,
! [X_44,Y_4,Y_46] : is_a_theorem(implies(not(X_44),implies(Y_4,implies(X_44,Y_46)))),
inference(resolution,[status(thm)],[c_21,c_113]) ).
tff(c_60,plain,
! [X_27,Z_28,Y_29] : is_a_theorem(implies(implies(not(X_27),Z_28),implies(implies(Y_29,Z_28),implies(implies(X_27,Y_29),Z_28)))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_156,plain,
! [Y_47,Z_48,X_49] :
( is_a_theorem(implies(implies(Y_47,Z_48),implies(implies(X_49,Y_47),Z_48)))
| ~ is_a_theorem(implies(not(X_49),Z_48)) ),
inference(resolution,[status(thm)],[c_60,c_2]) ).
tff(c_460,plain,
! [X_119,Y_120,Z_121] :
( is_a_theorem(implies(implies(X_119,Y_120),Z_121))
| ~ is_a_theorem(implies(Y_120,Z_121))
| ~ is_a_theorem(implies(not(X_119),Z_121)) ),
inference(resolution,[status(thm)],[c_156,c_2]) ).
tff(c_484,plain,
! [Z_136,X_137,Y_138] :
( is_a_theorem(Z_136)
| ~ is_a_theorem(implies(X_137,Y_138))
| ~ is_a_theorem(implies(Y_138,Z_136))
| ~ is_a_theorem(implies(not(X_137),Z_136)) ),
inference(resolution,[status(thm)],[c_460,c_2]) ).
tff(c_2373,plain,
! [Z_224,Y_225,X_226,Y_227] :
( is_a_theorem(Z_224)
| ~ is_a_theorem(implies(implies(Y_225,implies(X_226,Y_227)),Z_224))
| ~ is_a_theorem(implies(not(not(X_226)),Z_224)) ),
inference(resolution,[status(thm)],[c_154,c_484]) ).
tff(c_10988,plain,
! [Y_557,X_558,Y_559] :
( is_a_theorem(implies(Y_557,implies(X_558,Y_559)))
| ~ is_a_theorem(implies(not(not(X_558)),implies(Y_557,implies(X_558,Y_559)))) ),
inference(resolution,[status(thm)],[c_4,c_2373]) ).
tff(c_11330,plain,
! [Y_562,X_563,Y_564] : is_a_theorem(implies(Y_562,implies(X_563,implies(not(X_563),Y_564)))),
inference(resolution,[status(thm)],[c_150,c_10988]) ).
tff(c_2503,plain,
! [Y_4,X_226,Y_227] :
( is_a_theorem(implies(Y_4,implies(X_226,Y_227)))
| ~ is_a_theorem(implies(not(not(X_226)),implies(Y_4,implies(X_226,Y_227)))) ),
inference(resolution,[status(thm)],[c_4,c_2373]) ).
tff(c_11455,plain,
! [X_563,Y_564] : is_a_theorem(implies(X_563,implies(not(X_563),Y_564))),
inference(resolution,[status(thm)],[c_11330,c_2503]) ).
tff(c_10,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_11525,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_11455,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.37 % Computer : n031.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 13:59:59 EDT 2023
% 0.16/0.37 % CPUTime :
% 9.33/3.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.33/3.29
% 9.33/3.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.33/3.32
% 9.33/3.32 Inference rules
% 9.33/3.32 ----------------------
% 9.33/3.32 #Ref : 0
% 9.33/3.32 #Sup : 2450
% 9.33/3.32 #Fact : 0
% 9.33/3.32 #Define : 0
% 9.33/3.32 #Split : 12
% 9.33/3.32 #Chain : 0
% 9.33/3.32 #Close : 0
% 9.33/3.32
% 9.33/3.32 Ordering : KBO
% 9.33/3.32
% 9.33/3.32 Simplification rules
% 9.33/3.32 ----------------------
% 9.33/3.32 #Subsume : 1328
% 9.33/3.32 #Demod : 619
% 9.33/3.32 #Tautology : 498
% 9.33/3.32 #SimpNegUnit : 337
% 9.33/3.32 #BackRed : 145
% 9.33/3.32
% 9.33/3.32 #Partial instantiations: 0
% 9.33/3.32 #Strategies tried : 1
% 9.33/3.32
% 9.33/3.32 Timing (in seconds)
% 9.33/3.32 ----------------------
% 9.33/3.33 Preprocessing : 0.40
% 9.33/3.33 Parsing : 0.22
% 9.33/3.33 CNF conversion : 0.02
% 9.33/3.33 Main loop : 1.86
% 9.33/3.33 Inferencing : 0.60
% 9.33/3.33 Reduction : 0.49
% 9.33/3.33 Demodulation : 0.34
% 9.33/3.33 BG Simplification : 0.03
% 9.33/3.33 Subsumption : 0.63
% 9.33/3.33 Abstraction : 0.04
% 9.33/3.33 MUC search : 0.00
% 9.33/3.33 Cooper : 0.00
% 9.33/3.33 Total : 2.31
% 9.33/3.33 Index Insertion : 0.00
% 9.33/3.33 Index Deletion : 0.00
% 9.33/3.33 Index Matching : 0.00
% 9.33/3.33 BG Taut test : 0.00
%------------------------------------------------------------------------------