TSTP Solution File: LCL112-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL112-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 : n022.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:24 EDT 2023
% Result : Unsatisfiable 4.15s 2.01s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 19 unt; 4 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 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 : 60 (; 60 !; 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_35,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] : is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))),
file(unknown,unknown) ).
tff(f_43,axiom,
~ is_a_theorem(implies(a,not(not(a)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_10,plain,
! [X_10,Y_11] : is_a_theorem(implies(implies(not(X_10),not(Y_11)),implies(Y_11,X_10))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_51,plain,
! [X_24,Y_25,Z_26] : is_a_theorem(implies(implies(X_24,Y_25),implies(implies(Y_25,Z_26),implies(X_24,Z_26)))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
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_33]) ).
tff(c_64,plain,
! [Y_32,Z_33,X_34] :
( is_a_theorem(implies(implies(Y_32,Z_33),implies(X_34,Z_33)))
| ~ is_a_theorem(implies(X_34,Y_32)) ),
inference(resolution,[status(thm)],[c_51,c_2]) ).
tff(c_127,plain,
! [X_43,Z_44,Y_45] :
( is_a_theorem(implies(X_43,Z_44))
| ~ is_a_theorem(implies(Y_45,Z_44))
| ~ is_a_theorem(implies(X_43,Y_45)) ),
inference(resolution,[status(thm)],[c_64,c_2]) ).
tff(c_715,plain,
! [X_95,Y_96,X_97] :
( is_a_theorem(implies(X_95,implies(Y_96,X_97)))
| ~ is_a_theorem(implies(X_95,implies(not(X_97),not(Y_96)))) ),
inference(resolution,[status(thm)],[c_10,c_127]) ).
tff(c_799,plain,
! [Y_99,X_100] : is_a_theorem(implies(not(Y_99),implies(Y_99,X_100))),
inference(resolution,[status(thm)],[c_4,c_715]) ).
tff(c_152,plain,
! [X_43,Y_11,X_10] :
( is_a_theorem(implies(X_43,implies(Y_11,X_10)))
| ~ is_a_theorem(implies(X_43,implies(not(X_10),not(Y_11)))) ),
inference(resolution,[status(thm)],[c_10,c_127]) ).
tff(c_887,plain,
! [X_106,Y_107] : is_a_theorem(implies(not(not(X_106)),implies(Y_107,X_106))),
inference(resolution,[status(thm)],[c_799,c_152]) ).
tff(c_14,plain,
! [Y_14,X_15] :
( is_a_theorem(Y_14)
| ~ is_a_theorem(X_15)
| ~ is_a_theorem(implies(X_15,Y_14)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_18,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_14]) ).
tff(c_59,plain,
! [X_30,Y_31] : is_a_theorem(implies(implies(implies(X_30,Y_31),Y_31),implies(implies(Y_31,X_30),X_30))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_69,plain,
! [Y_35,X_36] :
( is_a_theorem(implies(implies(Y_35,X_36),X_36))
| ~ is_a_theorem(implies(implies(X_36,Y_35),Y_35)) ),
inference(resolution,[status(thm)],[c_59,c_2]) ).
tff(c_77,plain,
! [X_3,X_36] :
( is_a_theorem(implies(implies(X_3,X_36),X_36))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_18,c_69]) ).
tff(c_147,plain,
! [X_43,X_36,X_3] :
( is_a_theorem(implies(X_43,X_36))
| ~ is_a_theorem(implies(X_43,implies(X_3,X_36)))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_77,c_127]) ).
tff(c_905,plain,
! [X_106,Y_107] :
( is_a_theorem(implies(not(not(X_106)),X_106))
| ~ is_a_theorem(Y_107) ),
inference(resolution,[status(thm)],[c_887,c_147]) ).
tff(c_910,plain,
! [Y_107] : ~ is_a_theorem(Y_107),
inference(splitLeft,[status(thm)],[c_905]) ).
tff(c_816,plain,
! [X_10,Y_11] : is_a_theorem(implies(not(not(X_10)),implies(Y_11,X_10))),
inference(resolution,[status(thm)],[c_799,c_152]) ).
tff(c_946,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_910,c_816]) ).
tff(c_948,plain,
! [X_108] : is_a_theorem(implies(not(not(X_108)),X_108)),
inference(splitRight,[status(thm)],[c_905]) ).
tff(c_28,plain,
! [X_18,Y_19] : is_a_theorem(implies(implies(not(X_18),not(Y_19)),implies(Y_19,X_18))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_32,plain,
! [Y_19,X_18] :
( is_a_theorem(implies(Y_19,X_18))
| ~ is_a_theorem(implies(not(X_18),not(Y_19))) ),
inference(resolution,[status(thm)],[c_28,c_2]) ).
tff(c_980,plain,
! [Y_19] : is_a_theorem(implies(Y_19,not(not(Y_19)))),
inference(resolution,[status(thm)],[c_948,c_32]) ).
tff(c_12,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_1070,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_980,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL112-1 : TPTP v8.1.2. Released v1.0.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.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:28:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.15/2.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.15/2.02
% 4.15/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.15/2.05
% 4.15/2.05 Inference rules
% 4.15/2.05 ----------------------
% 4.15/2.05 #Ref : 0
% 4.15/2.05 #Sup : 237
% 4.15/2.05 #Fact : 0
% 4.15/2.05 #Define : 0
% 4.15/2.05 #Split : 6
% 4.15/2.05 #Chain : 0
% 4.15/2.05 #Close : 0
% 4.15/2.05
% 4.15/2.05 Ordering : KBO
% 4.15/2.05
% 4.15/2.05 Simplification rules
% 4.15/2.05 ----------------------
% 4.15/2.05 #Subsume : 134
% 4.15/2.05 #Demod : 17
% 4.15/2.05 #Tautology : 30
% 4.15/2.05 #SimpNegUnit : 60
% 4.15/2.05 #BackRed : 14
% 4.15/2.05
% 4.15/2.05 #Partial instantiations: 0
% 4.15/2.05 #Strategies tried : 1
% 4.15/2.05
% 4.15/2.05 Timing (in seconds)
% 4.15/2.05 ----------------------
% 4.15/2.06 Preprocessing : 0.41
% 4.15/2.06 Parsing : 0.23
% 4.15/2.06 CNF conversion : 0.02
% 4.15/2.06 Main loop : 0.58
% 4.15/2.06 Inferencing : 0.24
% 4.15/2.06 Reduction : 0.14
% 4.15/2.06 Demodulation : 0.09
% 4.15/2.06 BG Simplification : 0.02
% 4.15/2.06 Subsumption : 0.14
% 4.15/2.06 Abstraction : 0.02
% 4.15/2.06 MUC search : 0.00
% 4.15/2.06 Cooper : 0.00
% 4.15/2.06 Total : 1.04
% 4.15/2.06 Index Insertion : 0.00
% 4.15/2.06 Index Deletion : 0.00
% 4.15/2.06 Index Matching : 0.00
% 4.15/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------