TSTP Solution File: LCL066-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL066-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 : n020.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:17 EDT 2023
% Result : Unsatisfiable 5.33s 2.35s
% Output : CNFRefutation 5.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 18 unt; 5 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 70 (; 70 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(b,type,
b: $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(Y,X))),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file(unknown,unknown) ).
tff(f_44,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
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_38]) ).
tff(c_57,plain,
! [X_22,Y_23,Z_24] : is_a_theorem(implies(implies(X_22,implies(Y_23,Z_24)),implies(implies(X_22,Y_23),implies(X_22,Z_24)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
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_36]) ).
tff(c_65,plain,
! [X_28,Y_29,Z_30] :
( is_a_theorem(implies(implies(X_28,Y_29),implies(X_28,Z_30)))
| ~ is_a_theorem(implies(X_28,implies(Y_29,Z_30))) ),
inference(resolution,[status(thm)],[c_57,c_2]) ).
tff(c_70,plain,
! [X_31,Z_32,Y_33] :
( is_a_theorem(implies(X_31,Z_32))
| ~ is_a_theorem(implies(X_31,Y_33))
| ~ is_a_theorem(implies(X_31,implies(Y_33,Z_32))) ),
inference(resolution,[status(thm)],[c_65,c_2]) ).
tff(c_97,plain,
! [X_34,Y_35] :
( is_a_theorem(implies(X_34,X_34))
| ~ is_a_theorem(implies(X_34,Y_35)) ),
inference(resolution,[status(thm)],[c_4,c_70]) ).
tff(c_115,plain,
! [X_3] : is_a_theorem(implies(X_3,X_3)),
inference(resolution,[status(thm)],[c_4,c_97]) ).
tff(c_8,plain,
! [X_8,Y_9] : is_a_theorem(implies(implies(not(X_8),not(Y_9)),implies(Y_9,X_8))),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_12,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_36]) ).
tff(c_16,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_12]) ).
tff(c_135,plain,
! [Y_37,Z_38,Y_39] :
( is_a_theorem(implies(Y_37,Z_38))
| ~ is_a_theorem(implies(Y_37,Y_39))
| ~ is_a_theorem(implies(Y_39,Z_38)) ),
inference(resolution,[status(thm)],[c_16,c_70]) ).
tff(c_157,plain,
! [Y_40,Z_41,X_42] :
( is_a_theorem(implies(Y_40,Z_41))
| ~ is_a_theorem(implies(X_42,Z_41))
| ~ is_a_theorem(X_42) ),
inference(resolution,[status(thm)],[c_16,c_135]) ).
tff(c_407,plain,
! [Y_72,Y_73,X_74] :
( is_a_theorem(implies(Y_72,implies(Y_73,X_74)))
| ~ is_a_theorem(implies(not(X_74),not(Y_73))) ),
inference(resolution,[status(thm)],[c_8,c_157]) ).
tff(c_424,plain,
! [Y_75,X_76] : is_a_theorem(implies(Y_75,implies(X_76,X_76))),
inference(resolution,[status(thm)],[c_115,c_407]) ).
tff(c_94,plain,
! [X_8,Y_9] :
( is_a_theorem(implies(implies(not(X_8),not(Y_9)),X_8))
| ~ is_a_theorem(implies(implies(not(X_8),not(Y_9)),Y_9)) ),
inference(resolution,[status(thm)],[c_8,c_70]) ).
tff(c_446,plain,
! [X_8,X_76] : is_a_theorem(implies(implies(not(X_8),not(implies(X_76,X_76))),X_8)),
inference(resolution,[status(thm)],[c_424,c_94]) ).
tff(c_956,plain,
! [X_122,Y_123,Z_124] :
( is_a_theorem(implies(implies(not(X_122),not(Y_123)),Z_124))
| ~ is_a_theorem(implies(implies(Y_123,X_122),Z_124)) ),
inference(resolution,[status(thm)],[c_8,c_135]) ).
tff(c_156,plain,
! [X_3,Z_38,Y_4] :
( is_a_theorem(implies(X_3,Z_38))
| ~ is_a_theorem(implies(implies(Y_4,X_3),Z_38)) ),
inference(resolution,[status(thm)],[c_4,c_135]) ).
tff(c_1711,plain,
! [Y_163,Z_164,X_165] :
( is_a_theorem(implies(not(Y_163),Z_164))
| ~ is_a_theorem(implies(implies(Y_163,X_165),Z_164)) ),
inference(resolution,[status(thm)],[c_956,c_156]) ).
tff(c_1858,plain,
! [X_168] : is_a_theorem(implies(not(not(X_168)),X_168)),
inference(resolution,[status(thm)],[c_446,c_1711]) ).
tff(c_30,plain,
! [X_16,Y_17] : is_a_theorem(implies(implies(not(X_16),not(Y_17)),implies(Y_17,X_16))),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_34,plain,
! [Y_17,X_16] :
( is_a_theorem(implies(Y_17,X_16))
| ~ is_a_theorem(implies(not(X_16),not(Y_17))) ),
inference(resolution,[status(thm)],[c_30,c_2]) ).
tff(c_1899,plain,
! [Y_169] : is_a_theorem(implies(Y_169,not(not(Y_169)))),
inference(resolution,[status(thm)],[c_1858,c_34]) ).
tff(c_983,plain,
! [Y_123,Z_124,X_122] :
( is_a_theorem(implies(not(Y_123),Z_124))
| ~ is_a_theorem(implies(implies(Y_123,X_122),Z_124)) ),
inference(resolution,[status(thm)],[c_956,c_156]) ).
tff(c_2875,plain,
! [Y_210,X_211] : is_a_theorem(implies(not(Y_210),not(not(implies(Y_210,X_211))))),
inference(resolution,[status(thm)],[c_1899,c_983]) ).
tff(c_2962,plain,
! [Y_217,X_218] : is_a_theorem(implies(not(implies(Y_217,X_218)),Y_217)),
inference(resolution,[status(thm)],[c_2875,c_34]) ).
tff(c_3010,plain,
! [Y_17,X_218] : is_a_theorem(implies(Y_17,implies(not(Y_17),X_218))),
inference(resolution,[status(thm)],[c_2962,c_34]) ).
tff(c_10,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_3013,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3010,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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.36 % Computer : n020.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:25:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.33/2.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.33/2.35
% 5.33/2.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.62/2.39
% 5.62/2.39 Inference rules
% 5.62/2.39 ----------------------
% 5.62/2.39 #Ref : 0
% 5.62/2.39 #Sup : 667
% 5.62/2.39 #Fact : 0
% 5.62/2.39 #Define : 0
% 5.62/2.39 #Split : 8
% 5.62/2.39 #Chain : 0
% 5.62/2.39 #Close : 0
% 5.62/2.39
% 5.62/2.39 Ordering : KBO
% 5.62/2.39
% 5.62/2.39 Simplification rules
% 5.62/2.39 ----------------------
% 5.62/2.39 #Subsume : 215
% 5.62/2.39 #Demod : 128
% 5.62/2.39 #Tautology : 135
% 5.62/2.39 #SimpNegUnit : 26
% 5.62/2.39 #BackRed : 8
% 5.62/2.39
% 5.62/2.39 #Partial instantiations: 0
% 5.62/2.39 #Strategies tried : 1
% 5.62/2.39
% 5.62/2.39 Timing (in seconds)
% 5.62/2.39 ----------------------
% 5.62/2.39 Preprocessing : 0.40
% 5.62/2.39 Parsing : 0.22
% 5.62/2.39 CNF conversion : 0.02
% 5.62/2.39 Main loop : 0.88
% 5.62/2.39 Inferencing : 0.35
% 5.62/2.39 Reduction : 0.23
% 5.62/2.39 Demodulation : 0.16
% 5.62/2.39 BG Simplification : 0.02
% 5.62/2.39 Subsumption : 0.21
% 5.62/2.39 Abstraction : 0.03
% 5.62/2.39 MUC search : 0.00
% 5.62/2.39 Cooper : 0.00
% 5.62/2.39 Total : 1.33
% 5.62/2.39 Index Insertion : 0.00
% 5.62/2.39 Index Deletion : 0.00
% 5.62/2.39 Index Matching : 0.00
% 5.62/2.39 BG Taut test : 0.00
%------------------------------------------------------------------------------