TSTP Solution File: LCL045-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL045-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:14 EDT 2023
% Result : Unsatisfiable 98.02s 85.25s
% Output : CNFRefutation 98.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 24 |; 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 : 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 : 60 (; 60 !; 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_36,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_42,axiom,
! [Y,Z,X] : is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
file(unknown,unknown) ).
tff(f_46,axiom,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(not(X_3),Y_4))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_6,plain,
! [X_5,Y_6] : is_a_theorem(implies(X_5,implies(Y_6,X_5))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_105,plain,
! [Y_34,Z_35,X_36] : is_a_theorem(implies(implies(Y_34,Z_35),implies(implies(X_36,Y_34),implies(X_36,Z_35)))),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_17,plain,
! [Y_19,X_20] :
( is_a_theorem(Y_19)
| ~ is_a_theorem(X_20)
| ~ is_a_theorem(implies(X_20,Y_19)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_24,plain,
! [X_3,Y_4] :
( is_a_theorem(implies(not(X_3),Y_4))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_4,c_17]) ).
tff(c_48,plain,
! [X_25,Y_26] : is_a_theorem(implies(implies(X_25,Y_26),implies(implies(not(X_25),Y_26),Y_26))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
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_34]) ).
tff(c_55,plain,
! [X_28,Y_29] :
( is_a_theorem(implies(implies(not(X_28),Y_29),Y_29))
| ~ is_a_theorem(implies(X_28,Y_29)) ),
inference(resolution,[status(thm)],[c_48,c_2]) ).
tff(c_60,plain,
! [Y_30,X_31] :
( is_a_theorem(Y_30)
| ~ is_a_theorem(implies(not(X_31),Y_30))
| ~ is_a_theorem(implies(X_31,Y_30)) ),
inference(resolution,[status(thm)],[c_55,c_2]) ).
tff(c_76,plain,
! [Y_4,X_3] :
( is_a_theorem(Y_4)
| ~ is_a_theorem(implies(X_3,Y_4))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_24,c_60]) ).
tff(c_109,plain,
! [X_36,Y_34,Z_35] :
( is_a_theorem(implies(implies(X_36,Y_34),implies(X_36,Z_35)))
| ~ is_a_theorem(implies(Y_34,Z_35)) ),
inference(resolution,[status(thm)],[c_105,c_76]) ).
tff(c_110,plain,
! [X_37,Y_38,Z_39] : is_a_theorem(implies(implies(X_37,implies(Y_38,Z_39)),implies(Y_38,implies(X_37,Z_39)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_227,plain,
! [Y_55,X_56,Z_57] :
( is_a_theorem(implies(Y_55,implies(X_56,Z_57)))
| ~ is_a_theorem(implies(X_56,implies(Y_55,Z_57))) ),
inference(resolution,[status(thm)],[c_110,c_76]) ).
tff(c_253,plain,
! [X_36,Y_34,Z_35] :
( is_a_theorem(implies(X_36,implies(implies(X_36,Y_34),Z_35)))
| ~ is_a_theorem(implies(Y_34,Z_35)) ),
inference(resolution,[status(thm)],[c_109,c_227]) ).
tff(c_25,plain,
! [Y_6,X_5] :
( is_a_theorem(implies(Y_6,X_5))
| ~ is_a_theorem(X_5) ),
inference(resolution,[status(thm)],[c_6,c_17]) ).
tff(c_582,plain,
! [Y_87,Y_88,Z_89] :
( is_a_theorem(implies(Y_87,implies(Y_88,Z_89)))
| ~ is_a_theorem(implies(Y_87,Z_89)) ),
inference(resolution,[status(thm)],[c_25,c_227]) ).
tff(c_59,plain,
! [Y_29,X_28] :
( is_a_theorem(Y_29)
| ~ is_a_theorem(implies(not(X_28),Y_29))
| ~ is_a_theorem(implies(X_28,Y_29)) ),
inference(resolution,[status(thm)],[c_55,c_2]) ).
tff(c_15742,plain,
! [Y_587,Z_588,X_589] :
( is_a_theorem(implies(Y_587,Z_588))
| ~ is_a_theorem(implies(X_589,implies(Y_587,Z_588)))
| ~ is_a_theorem(implies(not(X_589),Z_588)) ),
inference(resolution,[status(thm)],[c_582,c_59]) ).
tff(c_285819,plain,
! [X_2844,Y_2845,Z_2846] :
( is_a_theorem(implies(implies(X_2844,Y_2845),Z_2846))
| ~ is_a_theorem(implies(not(X_2844),Z_2846))
| ~ is_a_theorem(implies(Y_2845,Z_2846)) ),
inference(resolution,[status(thm)],[c_253,c_15742]) ).
tff(c_14,plain,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_286409,plain,
( ~ is_a_theorem(implies(not(a),implies(not(b),not(a))))
| ~ is_a_theorem(implies(b,implies(not(b),not(a)))) ),
inference(resolution,[status(thm)],[c_285819,c_14]) ).
tff(c_286589,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6,c_286409]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL045-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.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:52:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 98.02/85.25 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 98.02/85.26
% 98.02/85.26 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 98.02/85.29
% 98.02/85.29 Inference rules
% 98.02/85.29 ----------------------
% 98.02/85.29 #Ref : 0
% 98.02/85.29 #Sup : 64733
% 98.02/85.29 #Fact : 0
% 98.02/85.29 #Define : 0
% 98.02/85.29 #Split : 1
% 98.02/85.29 #Chain : 0
% 98.02/85.29 #Close : 0
% 98.02/85.29
% 98.02/85.29 Ordering : KBO
% 98.02/85.29
% 98.02/85.29 Simplification rules
% 98.02/85.29 ----------------------
% 98.02/85.29 #Subsume : 18899
% 98.02/85.29 #Demod : 11270
% 98.02/85.29 #Tautology : 11351
% 98.02/85.29 #SimpNegUnit : 5
% 98.02/85.29 #BackRed : 0
% 98.02/85.29
% 98.02/85.29 #Partial instantiations: 0
% 98.02/85.29 #Strategies tried : 1
% 98.02/85.29
% 98.02/85.29 Timing (in seconds)
% 98.02/85.29 ----------------------
% 98.02/85.29 Preprocessing : 0.41
% 98.02/85.29 Parsing : 0.22
% 98.02/85.29 CNF conversion : 0.02
% 98.02/85.29 Main loop : 83.76
% 98.02/85.29 Inferencing : 4.78
% 98.02/85.29 Reduction : 32.88
% 98.02/85.29 Demodulation : 27.53
% 98.02/85.30 BG Simplification : 0.21
% 98.02/85.30 Subsumption : 41.90
% 98.02/85.30 Abstraction : 0.36
% 98.02/85.30 MUC search : 0.00
% 98.02/85.30 Cooper : 0.00
% 98.02/85.30 Total : 84.22
% 98.02/85.30 Index Insertion : 0.00
% 98.02/85.30 Index Deletion : 0.00
% 98.02/85.30 Index Matching : 0.00
% 98.02/85.30 BG Taut test : 0.00
%------------------------------------------------------------------------------