TSTP Solution File: LCL111-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL111-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 : n016.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 17.34s 8.45s
% Output : CNFRefutation 17.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 45 (; 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > c > 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(c,type,
c: $i ).
tff(f_44,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] : is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_5,Y_6,Z_7] : is_a_theorem(implies(implies(X_5,Y_6),implies(implies(Y_6,Z_7),implies(X_5,Z_7)))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_8,plain,
! [X_8,Y_9] : is_a_theorem(implies(implies(implies(X_8,Y_9),Y_9),implies(implies(Y_9,X_8),X_8))),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_34,plain,
! [X_22,Y_23,Z_24] : is_a_theorem(implies(implies(X_22,Y_23),implies(implies(Y_23,Z_24),implies(X_22,Z_24)))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
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_40]) ).
tff(c_80,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_34,c_2]) ).
tff(c_144,plain,
! [X_45,Z_46,Y_47] :
( is_a_theorem(implies(X_45,Z_46))
| ~ is_a_theorem(implies(Y_47,Z_46))
| ~ is_a_theorem(implies(X_45,Y_47)) ),
inference(resolution,[status(thm)],[c_80,c_2]) ).
tff(c_967,plain,
! [X_106,Y_107,X_108] :
( is_a_theorem(implies(X_106,implies(implies(Y_107,X_108),X_108)))
| ~ is_a_theorem(implies(X_106,implies(implies(X_108,Y_107),Y_107))) ),
inference(resolution,[status(thm)],[c_8,c_144]) ).
tff(c_1052,plain,
! [X_3,X_108] : is_a_theorem(implies(X_3,implies(implies(X_3,X_108),X_108))),
inference(resolution,[status(thm)],[c_4,c_967]) ).
tff(c_38,plain,
! [Y_23,Z_24,X_22] :
( is_a_theorem(implies(implies(Y_23,Z_24),implies(X_22,Z_24)))
| ~ is_a_theorem(implies(X_22,Y_23)) ),
inference(resolution,[status(thm)],[c_34,c_2]) ).
tff(c_1303,plain,
! [X_121,X_122,Z_123,Y_124] :
( is_a_theorem(implies(X_121,implies(X_122,Z_123)))
| ~ is_a_theorem(implies(X_121,implies(Y_124,Z_123)))
| ~ is_a_theorem(implies(X_122,Y_124)) ),
inference(resolution,[status(thm)],[c_38,c_144]) ).
tff(c_39714,plain,
! [X_1002,X_1003,X_1004] :
( is_a_theorem(implies(X_1002,implies(X_1003,X_1004)))
| ~ is_a_theorem(implies(X_1003,implies(X_1002,X_1004))) ),
inference(resolution,[status(thm)],[c_1052,c_1303]) ).
tff(c_40274,plain,
! [Y_6,Z_7,X_5] : is_a_theorem(implies(implies(Y_6,Z_7),implies(implies(X_5,Y_6),implies(X_5,Z_7)))),
inference(resolution,[status(thm)],[c_6,c_39714]) ).
tff(c_12,plain,
~ is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_42367,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40274,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL111-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/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.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:43:07 EDT 2023
% 0.20/0.35 % CPUTime :
% 17.34/8.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.34/8.45
% 17.34/8.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.46/8.48
% 17.46/8.48 Inference rules
% 17.46/8.48 ----------------------
% 17.46/8.48 #Ref : 0
% 17.46/8.48 #Sup : 10272
% 17.46/8.48 #Fact : 0
% 17.46/8.48 #Define : 0
% 17.46/8.48 #Split : 6
% 17.46/8.48 #Chain : 0
% 17.46/8.48 #Close : 0
% 17.46/8.48
% 17.46/8.48 Ordering : KBO
% 17.46/8.48
% 17.46/8.48 Simplification rules
% 17.46/8.48 ----------------------
% 17.46/8.48 #Subsume : 2729
% 17.46/8.48 #Demod : 1714
% 17.46/8.48 #Tautology : 1772
% 17.46/8.48 #SimpNegUnit : 59
% 17.46/8.48 #BackRed : 18
% 17.46/8.48
% 17.46/8.48 #Partial instantiations: 0
% 17.46/8.48 #Strategies tried : 1
% 17.46/8.48
% 17.46/8.48 Timing (in seconds)
% 17.46/8.48 ----------------------
% 17.46/8.49 Preprocessing : 0.41
% 17.46/8.49 Parsing : 0.23
% 17.46/8.49 CNF conversion : 0.02
% 17.46/8.49 Main loop : 6.91
% 17.46/8.49 Inferencing : 1.07
% 17.46/8.49 Reduction : 2.37
% 17.46/8.49 Demodulation : 1.80
% 17.46/8.49 BG Simplification : 0.06
% 17.46/8.49 Subsumption : 2.99
% 17.46/8.49 Abstraction : 0.08
% 17.46/8.49 MUC search : 0.00
% 17.46/8.49 Cooper : 0.00
% 17.46/8.49 Total : 7.37
% 17.46/8.49 Index Insertion : 0.00
% 17.46/8.49 Index Deletion : 0.00
% 17.46/8.49 Index Matching : 0.00
% 17.46/8.49 BG Taut test : 0.00
%------------------------------------------------------------------------------