TSTP Solution File: LCL359-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL359-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/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 : 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:58 EDT 2023
% Result : Unsatisfiable 15.63s 6.96s
% Output : CNFRefutation 15.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 40 (; 40 !; 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,y),implies(implies(z,x),implies(implies(y,u),implies(z,u))))),
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_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_57,plain,
! [X_24,Y_4,Z_5,X_3] :
( is_a_theorem(implies(X_24,implies(implies(Y_4,Z_5),implies(X_3,Z_5))))
| ~ is_a_theorem(implies(X_24,implies(X_3,Y_4))) ),
inference(resolution,[status(thm)],[c_4,c_45]) ).
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_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_2701,plain,
! [X_206,Z_209,X_208,X_207,Y_210] :
( is_a_theorem(implies(X_206,implies(X_207,implies(X_208,Z_209))))
| ~ is_a_theorem(implies(X_207,implies(Y_210,Z_209)))
| ~ is_a_theorem(implies(X_206,implies(X_208,Y_210))) ),
inference(resolution,[status(thm)],[c_57,c_255]) ).
tff(c_39706,plain,
! [X_952,Z_954,Y_956,X_953,X_955] :
( is_a_theorem(implies(X_952,implies(implies(X_953,Y_956),implies(X_955,implies(X_953,Z_954)))))
| ~ is_a_theorem(implies(X_952,implies(X_955,implies(Y_956,Z_954)))) ),
inference(resolution,[status(thm)],[c_4,c_2701]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(x,y),implies(implies(z,x),implies(implies(y,u),implies(z,u))))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_39935,plain,
~ is_a_theorem(implies(implies(x,y),implies(implies(y,u),implies(x,u)))),
inference(resolution,[status(thm)],[c_39706,c_10]) ).
tff(c_40017,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_39935]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LCL359-1 : TPTP v8.1.2. Released v2.3.0.
% 0.13/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.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.22/0.37 % DateTime : Thu Aug 3 14:05:59 EDT 2023
% 0.22/0.37 % CPUTime :
% 15.63/6.96 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.63/6.97
% 15.63/6.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.63/6.99
% 15.63/6.99 Inference rules
% 15.63/6.99 ----------------------
% 15.63/6.99 #Ref : 0
% 15.63/6.99 #Sup : 9681
% 15.63/6.99 #Fact : 0
% 15.63/6.99 #Define : 0
% 15.63/6.99 #Split : 16
% 15.63/6.99 #Chain : 0
% 15.63/6.99 #Close : 0
% 15.63/6.99
% 15.63/6.99 Ordering : KBO
% 15.63/6.99
% 15.63/6.99 Simplification rules
% 15.63/6.99 ----------------------
% 15.63/6.99 #Subsume : 3030
% 15.63/6.99 #Demod : 1024
% 15.63/6.99 #Tautology : 1092
% 15.63/6.99 #SimpNegUnit : 0
% 15.63/6.99 #BackRed : 0
% 15.63/6.99
% 15.63/6.99 #Partial instantiations: 0
% 15.63/6.99 #Strategies tried : 1
% 15.63/7.00
% 15.63/7.00 Timing (in seconds)
% 15.63/7.00 ----------------------
% 15.63/7.00 Preprocessing : 0.40
% 15.63/7.00 Parsing : 0.22
% 15.63/7.00 CNF conversion : 0.02
% 15.63/7.00 Main loop : 5.52
% 15.63/7.00 Inferencing : 0.98
% 15.63/7.00 Reduction : 1.31
% 15.63/7.00 Demodulation : 0.94
% 15.63/7.00 BG Simplification : 0.06
% 15.63/7.00 Subsumption : 2.84
% 15.63/7.00 Abstraction : 0.08
% 15.63/7.00 MUC search : 0.00
% 15.63/7.00 Cooper : 0.00
% 15.63/7.00 Total : 5.97
% 15.63/7.00 Index Insertion : 0.00
% 15.63/7.00 Index Deletion : 0.00
% 15.63/7.00 Index Matching : 0.00
% 15.63/7.00 BG Taut test : 0.00
%------------------------------------------------------------------------------