TSTP Solution File: LCL399-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL399-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 : n007.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:48:01 EDT 2023
% Result : Unsatisfiable 11.30s 4.09s
% Output : CNFRefutation 11.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 12 unt; 5 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 45 ( 24 ~; 21 |; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 (; 59 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > y > x
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X] : is_a_theorem(implies(implies(not(X),X),X)),
file(unknown,unknown) ).
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(not(x),not(implies(y,y))),x)),
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_38]) ).
tff(c_6,plain,
! [X_6] : is_a_theorem(implies(implies(not(X_6),X_6),X_6)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_35,plain,
! [X_18,Y_19,Z_20] : is_a_theorem(implies(implies(X_18,Y_19),implies(implies(Y_19,Z_20),implies(X_18,Z_20)))),
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_35,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_13,plain,
! [Y_12,X_13] :
( is_a_theorem(Y_12)
| ~ is_a_theorem(X_13)
| ~ is_a_theorem(implies(X_13,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_21,plain,
! [X_7,Y_8] :
( is_a_theorem(implies(not(X_7),Y_8))
| ~ is_a_theorem(X_7) ),
inference(resolution,[status(thm)],[c_8,c_13]) ).
tff(c_39,plain,
! [Y_19,Z_20,X_18] :
( is_a_theorem(implies(implies(Y_19,Z_20),implies(X_18,Z_20)))
| ~ is_a_theorem(implies(X_18,Y_19)) ),
inference(resolution,[status(thm)],[c_35,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_39,c_45]) ).
tff(c_295,plain,
! [X_59,X_60,Y_61] :
( is_a_theorem(implies(X_59,implies(X_60,Y_61)))
| ~ is_a_theorem(implies(X_60,not(X_59))) ),
inference(resolution,[status(thm)],[c_8,c_255]) ).
tff(c_319,plain,
! [X_59,X_7,Y_61] :
( is_a_theorem(implies(X_59,implies(not(X_7),Y_61)))
| ~ is_a_theorem(X_7) ),
inference(resolution,[status(thm)],[c_21,c_295]) ).
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_2096,plain,
! [X_173,Y_174,X_175,Z_176] :
( is_a_theorem(implies(implies(X_173,Y_174),implies(X_175,implies(X_173,Z_176))))
| ~ is_a_theorem(implies(X_175,implies(Y_174,Z_176))) ),
inference(resolution,[status(thm)],[c_4,c_255]) ).
tff(c_59,plain,
! [X_24,X_6] :
( is_a_theorem(implies(X_24,X_6))
| ~ is_a_theorem(implies(X_24,implies(not(X_6),X_6))) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_13269,plain,
! [X_518,Y_519,Z_520] :
( is_a_theorem(implies(implies(X_518,Y_519),implies(X_518,Z_520)))
| ~ is_a_theorem(implies(not(implies(X_518,Z_520)),implies(Y_519,Z_520))) ),
inference(resolution,[status(thm)],[c_2096,c_59]) ).
tff(c_17845,plain,
! [X_605,X_606,Y_607] :
( is_a_theorem(implies(implies(X_605,not(X_606)),implies(X_605,Y_607)))
| ~ is_a_theorem(X_606) ),
inference(resolution,[status(thm)],[c_319,c_13269]) ).
tff(c_17979,plain,
! [Y_608,X_609] :
( is_a_theorem(implies(implies(not(Y_608),not(X_609)),Y_608))
| ~ is_a_theorem(X_609) ),
inference(resolution,[status(thm)],[c_17845,c_59]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(not(x),not(implies(y,y))),x)),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_18096,plain,
~ is_a_theorem(implies(y,y)),
inference(resolution,[status(thm)],[c_17979,c_10]) ).
tff(c_18144,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_18096]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL399-1 : TPTP v8.1.2. Released v2.3.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 : n007.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:51:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.30/4.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.30/4.10
% 11.30/4.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.30/4.12
% 11.30/4.12 Inference rules
% 11.30/4.12 ----------------------
% 11.30/4.12 #Ref : 0
% 11.30/4.12 #Sup : 4417
% 11.30/4.12 #Fact : 0
% 11.30/4.12 #Define : 0
% 11.30/4.12 #Split : 8
% 11.30/4.12 #Chain : 0
% 11.30/4.12 #Close : 0
% 11.30/4.12
% 11.30/4.12 Ordering : KBO
% 11.30/4.12
% 11.30/4.12 Simplification rules
% 11.30/4.12 ----------------------
% 11.30/4.12 #Subsume : 1576
% 11.30/4.12 #Demod : 434
% 11.30/4.12 #Tautology : 472
% 11.30/4.12 #SimpNegUnit : 0
% 11.30/4.12 #BackRed : 0
% 11.30/4.12
% 11.30/4.12 #Partial instantiations: 0
% 11.30/4.12 #Strategies tried : 1
% 11.30/4.12
% 11.30/4.12 Timing (in seconds)
% 11.30/4.12 ----------------------
% 11.30/4.13 Preprocessing : 0.38
% 11.30/4.13 Parsing : 0.21
% 11.30/4.13 CNF conversion : 0.02
% 11.30/4.13 Main loop : 2.69
% 11.30/4.13 Inferencing : 0.68
% 11.30/4.13 Reduction : 0.57
% 11.30/4.13 Demodulation : 0.42
% 11.30/4.13 BG Simplification : 0.04
% 11.30/4.13 Subsumption : 1.19
% 11.30/4.13 Abstraction : 0.05
% 11.30/4.13 MUC search : 0.00
% 11.30/4.13 Cooper : 0.00
% 11.30/4.13 Total : 3.12
% 11.30/4.13 Index Insertion : 0.00
% 11.30/4.13 Index Deletion : 0.00
% 11.30/4.13 Index Matching : 0.00
% 11.30/4.13 BG Taut test : 0.00
%------------------------------------------------------------------------------