TSTP Solution File: LCL076-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL076-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/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 : n019.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:18 EDT 2023
% Result : Unsatisfiable 3.79s 1.90s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 16 unt; 4 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 20 |; 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 : 57 (; 57 !; 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_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
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_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_44,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_38]) ).
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_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_49,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_57,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_49,c_2]) ).
tff(c_62,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_57,c_2]) ).
tff(c_261,plain,
! [X_57,Y_58] :
( is_a_theorem(implies(implies(not(X_57),not(Y_58)),X_57))
| ~ is_a_theorem(implies(implies(not(X_57),not(Y_58)),Y_58)) ),
inference(resolution,[status(thm)],[c_8,c_62]) ).
tff(c_277,plain,
! [X_57,X_3] :
( is_a_theorem(implies(implies(not(X_57),not(X_3)),X_57))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_16,c_261]) ).
tff(c_126,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_62]) ).
tff(c_148,plain,
! [X_40,Z_41,Y_42] :
( is_a_theorem(implies(X_40,Z_41))
| ~ is_a_theorem(implies(implies(Y_42,X_40),Z_41)) ),
inference(resolution,[status(thm)],[c_4,c_126]) ).
tff(c_182,plain,
! [Y_43,X_44] : is_a_theorem(implies(not(Y_43),implies(Y_43,X_44))),
inference(resolution,[status(thm)],[c_8,c_148]) ).
tff(c_87,plain,
! [Y_4,Z_32,Y_33] :
( is_a_theorem(implies(Y_4,Z_32))
| ~ is_a_theorem(implies(Y_4,Y_33))
| ~ is_a_theorem(implies(Y_33,Z_32)) ),
inference(resolution,[status(thm)],[c_16,c_62]) ).
tff(c_575,plain,
! [Y_96,Z_97,X_98] :
( is_a_theorem(implies(not(Y_96),Z_97))
| ~ is_a_theorem(implies(implies(Y_96,X_98),Z_97)) ),
inference(resolution,[status(thm)],[c_182,c_87]) ).
tff(c_626,plain,
! [X_57,X_3] :
( is_a_theorem(implies(not(not(X_57)),X_57))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_277,c_575]) ).
tff(c_654,plain,
! [X_3] : ~ is_a_theorem(X_3),
inference(splitLeft,[status(thm)],[c_626]) ).
tff(c_636,plain,
! [X_8,Y_9] : is_a_theorem(implies(not(not(X_8)),implies(Y_9,X_8))),
inference(resolution,[status(thm)],[c_8,c_575]) ).
tff(c_688,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_654,c_636]) ).
tff(c_690,plain,
! [X_101] : is_a_theorem(implies(not(not(X_101)),X_101)),
inference(splitRight,[status(thm)],[c_626]) ).
tff(c_26,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_30,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_26,c_2]) ).
tff(c_714,plain,
! [Y_17] : is_a_theorem(implies(Y_17,not(not(Y_17)))),
inference(resolution,[status(thm)],[c_690,c_30]) ).
tff(c_10,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_735,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_714,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL076-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/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 : n019.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.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:52:02 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.79/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.79/1.91
% 3.79/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.79/1.94
% 3.79/1.94 Inference rules
% 3.79/1.94 ----------------------
% 3.79/1.94 #Ref : 0
% 3.79/1.94 #Sup : 154
% 3.79/1.94 #Fact : 0
% 3.79/1.94 #Define : 0
% 3.79/1.94 #Split : 6
% 3.79/1.94 #Chain : 0
% 3.79/1.94 #Close : 0
% 3.79/1.94
% 3.79/1.94 Ordering : KBO
% 3.79/1.94
% 3.79/1.94 Simplification rules
% 3.79/1.94 ----------------------
% 3.79/1.94 #Subsume : 106
% 3.79/1.94 #Demod : 10
% 3.79/1.94 #Tautology : 15
% 3.79/1.94 #SimpNegUnit : 56
% 3.79/1.94 #BackRed : 15
% 3.79/1.94
% 3.79/1.94 #Partial instantiations: 0
% 3.79/1.94 #Strategies tried : 1
% 3.79/1.94
% 3.79/1.94 Timing (in seconds)
% 3.79/1.94 ----------------------
% 3.79/1.94 Preprocessing : 0.39
% 3.79/1.94 Parsing : 0.22
% 3.79/1.94 CNF conversion : 0.02
% 3.79/1.94 Main loop : 0.49
% 3.79/1.94 Inferencing : 0.21
% 3.79/1.94 Reduction : 0.11
% 3.79/1.94 Demodulation : 0.08
% 3.79/1.94 BG Simplification : 0.02
% 3.79/1.94 Subsumption : 0.11
% 3.79/1.94 Abstraction : 0.02
% 3.79/1.94 MUC search : 0.00
% 3.79/1.94 Cooper : 0.00
% 3.79/1.94 Total : 0.93
% 3.79/1.94 Index Insertion : 0.00
% 3.79/1.94 Index Deletion : 0.00
% 3.79/1.94 Index Matching : 0.00
% 3.79/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------