TSTP Solution File: LCL046-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL046-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 : n001.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:15 EDT 2023
% Result : Unsatisfiable 2.65s 1.66s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_45,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X] : is_a_theorem(implies(implies(not(X),X),X)),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_47,axiom,
~ is_a_theorem(implies(a,a)),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_7,Y_8] : is_a_theorem(implies(X_7,implies(not(X_7),Y_8))),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_6,plain,
! [X_6] : is_a_theorem(implies(implies(not(X_6),X_6),X_6)),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_23,plain,
! [X_15,Y_16,Z_17] : is_a_theorem(implies(implies(X_15,Y_16),implies(implies(Y_16,Z_17),implies(X_15,Z_17)))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
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_39]) ).
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_23,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_83,plain,
! [X_33,X_34] :
( is_a_theorem(implies(X_33,X_34))
| ~ is_a_theorem(implies(X_33,implies(not(X_34),X_34))) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_108,plain,
! [Y_8] : is_a_theorem(implies(Y_8,Y_8)),
inference(resolution,[status(thm)],[c_8,c_83]) ).
tff(c_10,plain,
~ is_a_theorem(implies(a,a)),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_111,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL046-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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 : n001.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 14:44:40 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.65/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.67
% 2.78/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.70
% 2.78/1.70 Inference rules
% 2.78/1.70 ----------------------
% 2.78/1.70 #Ref : 0
% 2.78/1.70 #Sup : 21
% 2.78/1.70 #Fact : 0
% 2.78/1.70 #Define : 0
% 2.78/1.70 #Split : 1
% 2.78/1.70 #Chain : 0
% 2.78/1.70 #Close : 0
% 2.78/1.70
% 2.78/1.70 Ordering : KBO
% 2.78/1.70
% 2.78/1.70 Simplification rules
% 2.78/1.70 ----------------------
% 2.78/1.70 #Subsume : 2
% 2.78/1.70 #Demod : 1
% 2.78/1.70 #Tautology : 2
% 2.78/1.70 #SimpNegUnit : 0
% 2.78/1.70 #BackRed : 1
% 2.78/1.70
% 2.78/1.70 #Partial instantiations: 0
% 2.78/1.70 #Strategies tried : 1
% 2.78/1.70
% 2.78/1.70 Timing (in seconds)
% 2.78/1.70 ----------------------
% 2.78/1.71 Preprocessing : 0.39
% 2.78/1.71 Parsing : 0.22
% 2.78/1.71 CNF conversion : 0.02
% 2.78/1.71 Main loop : 0.24
% 2.78/1.71 Inferencing : 0.10
% 2.78/1.71 Reduction : 0.05
% 2.78/1.71 Demodulation : 0.04
% 2.78/1.71 BG Simplification : 0.01
% 2.78/1.71 Subsumption : 0.05
% 2.78/1.71 Abstraction : 0.01
% 2.78/1.71 MUC search : 0.00
% 2.78/1.71 Cooper : 0.00
% 2.78/1.71 Total : 0.69
% 2.78/1.71 Index Insertion : 0.00
% 2.78/1.71 Index Deletion : 0.00
% 2.78/1.71 Index Matching : 0.00
% 2.78/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------