TSTP Solution File: LCL025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL025-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/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 : 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:12 EDT 2023
% Result : Unsatisfiable 9.98s 3.60s
% Output : CNFRefutation 9.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 26 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 4 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 45 (; 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > falsehood > 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(falsehood,type,
falsehood: $i ).
tff(b,type,
b: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_40,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
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_42,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_6,Y_7,Z_8] : is_a_theorem(implies(implies(X_6,implies(Y_7,Z_8)),implies(implies(X_6,Y_7),implies(X_6,Z_8)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_12,plain,
! [Y_11,X_12] :
( is_a_theorem(Y_11)
| ~ is_a_theorem(X_12)
| ~ is_a_theorem(implies(X_12,Y_11)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_16,plain,
! [Y_4,X_3] :
( is_a_theorem(implies(Y_4,X_3))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_4,c_12]) ).
tff(c_46,plain,
! [X_17,Y_18,Z_19] : is_a_theorem(implies(implies(X_17,implies(Y_18,Z_19)),implies(implies(X_17,Y_18),implies(X_17,Z_19)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
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_59,plain,
! [X_20,Y_21,Z_22] :
( is_a_theorem(implies(implies(X_20,Y_21),implies(X_20,Z_22)))
| ~ is_a_theorem(implies(X_20,implies(Y_21,Z_22))) ),
inference(resolution,[status(thm)],[c_46,c_2]) ).
tff(c_64,plain,
! [X_23,Z_24,Y_25] :
( is_a_theorem(implies(X_23,Z_24))
| ~ is_a_theorem(implies(X_23,Y_25))
| ~ is_a_theorem(implies(X_23,implies(Y_25,Z_24))) ),
inference(resolution,[status(thm)],[c_59,c_2]) ).
tff(c_120,plain,
! [Y_29,Z_30,Y_31] :
( is_a_theorem(implies(Y_29,Z_30))
| ~ is_a_theorem(implies(Y_29,Y_31))
| ~ is_a_theorem(implies(Y_31,Z_30)) ),
inference(resolution,[status(thm)],[c_16,c_64]) ).
tff(c_139,plain,
! [X_32,Z_33,Y_34] :
( is_a_theorem(implies(X_32,Z_33))
| ~ is_a_theorem(implies(implies(Y_34,X_32),Z_33)) ),
inference(resolution,[status(thm)],[c_4,c_120]) ).
tff(c_164,plain,
! [Y_7,Z_8,X_6] : is_a_theorem(implies(implies(Y_7,Z_8),implies(implies(X_6,Y_7),implies(X_6,Z_8)))),
inference(resolution,[status(thm)],[c_8,c_139]) ).
tff(c_50,plain,
! [X_17,Y_18,Z_19] :
( is_a_theorem(implies(implies(X_17,Y_18),implies(X_17,Z_19)))
| ~ is_a_theorem(implies(X_17,implies(Y_18,Z_19))) ),
inference(resolution,[status(thm)],[c_46,c_2]) ).
tff(c_3828,plain,
! [Y_183,X_184,Z_185] :
( is_a_theorem(implies(Y_183,implies(X_184,Z_185)))
| ~ is_a_theorem(implies(X_184,implies(Y_183,Z_185))) ),
inference(resolution,[status(thm)],[c_50,c_139]) ).
tff(c_3928,plain,
! [X_6,Y_7,Z_8] : is_a_theorem(implies(implies(X_6,Y_7),implies(implies(Y_7,Z_8),implies(X_6,Z_8)))),
inference(resolution,[status(thm)],[c_164,c_3828]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_18455,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3928,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % 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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 13:32:51 EDT 2023
% 0.12/0.33 % CPUTime :
% 9.98/3.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.98/3.60
% 9.98/3.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.98/3.64
% 9.98/3.64 Inference rules
% 9.98/3.64 ----------------------
% 9.98/3.64 #Ref : 0
% 9.98/3.64 #Sup : 4097
% 9.98/3.64 #Fact : 0
% 9.98/3.64 #Define : 0
% 9.98/3.64 #Split : 5
% 9.98/3.64 #Chain : 0
% 9.98/3.64 #Close : 0
% 9.98/3.64
% 9.98/3.64 Ordering : KBO
% 9.98/3.64
% 9.98/3.64 Simplification rules
% 9.98/3.64 ----------------------
% 9.98/3.64 #Subsume : 1607
% 9.98/3.64 #Demod : 867
% 9.98/3.64 #Tautology : 764
% 9.98/3.64 #SimpNegUnit : 43
% 9.98/3.64 #BackRed : 14
% 9.98/3.64
% 9.98/3.64 #Partial instantiations: 0
% 9.98/3.64 #Strategies tried : 1
% 9.98/3.64
% 9.98/3.64 Timing (in seconds)
% 9.98/3.64 ----------------------
% 9.98/3.64 Preprocessing : 0.39
% 9.98/3.64 Parsing : 0.22
% 9.98/3.64 CNF conversion : 0.02
% 9.98/3.65 Main loop : 2.21
% 9.98/3.65 Inferencing : 0.66
% 9.98/3.65 Reduction : 0.70
% 9.98/3.65 Demodulation : 0.53
% 9.98/3.65 BG Simplification : 0.04
% 9.98/3.65 Subsumption : 0.66
% 9.98/3.65 Abstraction : 0.05
% 9.98/3.65 MUC search : 0.00
% 9.98/3.65 Cooper : 0.00
% 9.98/3.65 Total : 2.66
% 9.98/3.65 Index Insertion : 0.00
% 9.98/3.65 Index Deletion : 0.00
% 9.98/3.65 Index Matching : 0.00
% 9.98/3.65 BG Taut test : 0.00
%------------------------------------------------------------------------------