TSTP Solution File: LCL356-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL356-1 : TPTP v8.1.2. Released v2.3.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 : n014.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:57 EDT 2023
% Result : Unsatisfiable 4.05s 2.14s
% Output : CNFRefutation 4.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > z > y > x > u
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(u,type,
u: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(z,type,
z: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_34,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_32,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(implies(x,implies(y,z)),implies(implies(u,y),implies(x,implies(u,z))))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5] : is_a_theorem(implies(implies(X_3,Y_4),implies(implies(Y_4,Z_5),implies(X_3,Z_5)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_33,plain,
! [X_17,Y_18,Z_19] : is_a_theorem(implies(implies(X_17,Y_18),implies(implies(Y_18,Z_19),implies(X_17,Z_19)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
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_32]) ).
tff(c_37,plain,
! [Y_18,Z_19,X_17] :
( is_a_theorem(implies(implies(Y_18,Z_19),implies(X_17,Z_19)))
| ~ is_a_theorem(implies(X_17,Y_18)) ),
inference(resolution,[status(thm)],[c_33,c_2]) ).
tff(c_40,plain,
! [Y_21,Z_22,X_23] :
( is_a_theorem(implies(implies(Y_21,Z_22),implies(X_23,Z_22)))
| ~ is_a_theorem(implies(X_23,Y_21)) ),
inference(resolution,[status(thm)],[c_33,c_2]) ).
tff(c_45,plain,
! [X_24,Z_25,Y_26] :
( is_a_theorem(implies(X_24,Z_25))
| ~ is_a_theorem(implies(Y_26,Z_25))
| ~ is_a_theorem(implies(X_24,Y_26)) ),
inference(resolution,[status(thm)],[c_40,c_2]) ).
tff(c_255,plain,
! [X_55,X_56,Z_57,Y_58] :
( is_a_theorem(implies(X_55,implies(X_56,Z_57)))
| ~ is_a_theorem(implies(X_55,implies(Y_58,Z_57)))
| ~ is_a_theorem(implies(X_56,Y_58)) ),
inference(resolution,[status(thm)],[c_37,c_45]) ).
tff(c_1470,plain,
! [X_135,Y_136,X_137,Z_138] :
( is_a_theorem(implies(implies(X_135,Y_136),implies(X_137,implies(X_135,Z_138))))
| ~ is_a_theorem(implies(X_137,implies(Y_136,Z_138))) ),
inference(resolution,[status(thm)],[c_4,c_255]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(u,y),implies(x,implies(u,z))))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_1500,plain,
~ is_a_theorem(implies(implies(u,y),implies(implies(y,z),implies(u,z)))),
inference(resolution,[status(thm)],[c_1470,c_10]) ).
tff(c_1514,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL356-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:55:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.05/2.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.05/2.14
% 4.05/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.49/2.17
% 4.49/2.17 Inference rules
% 4.49/2.17 ----------------------
% 4.49/2.17 #Ref : 0
% 4.49/2.17 #Sup : 359
% 4.49/2.17 #Fact : 0
% 4.49/2.17 #Define : 0
% 4.49/2.17 #Split : 5
% 4.49/2.17 #Chain : 0
% 4.49/2.17 #Close : 0
% 4.49/2.17
% 4.49/2.17 Ordering : KBO
% 4.49/2.17
% 4.49/2.17 Simplification rules
% 4.49/2.17 ----------------------
% 4.49/2.17 #Subsume : 152
% 4.49/2.17 #Demod : 7
% 4.49/2.17 #Tautology : 27
% 4.49/2.17 #SimpNegUnit : 0
% 4.49/2.17 #BackRed : 0
% 4.49/2.17
% 4.49/2.17 #Partial instantiations: 0
% 4.49/2.17 #Strategies tried : 1
% 4.49/2.17
% 4.49/2.17 Timing (in seconds)
% 4.49/2.17 ----------------------
% 4.49/2.18 Preprocessing : 0.40
% 4.49/2.18 Parsing : 0.23
% 4.49/2.18 CNF conversion : 0.02
% 4.49/2.18 Main loop : 0.62
% 4.49/2.18 Inferencing : 0.26
% 4.49/2.18 Reduction : 0.14
% 4.49/2.18 Demodulation : 0.10
% 4.49/2.18 BG Simplification : 0.02
% 4.49/2.18 Subsumption : 0.15
% 4.49/2.18 Abstraction : 0.02
% 4.49/2.18 MUC search : 0.00
% 4.49/2.18 Cooper : 0.00
% 4.49/2.18 Total : 1.07
% 4.49/2.18 Index Insertion : 0.00
% 4.49/2.18 Index Deletion : 0.00
% 4.49/2.18 Index Matching : 0.00
% 4.49/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------