TSTP Solution File: LCL043-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL043-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:14 EDT 2023
% Result : Unsatisfiable 3.74s 1.95s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 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,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_46,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_5,Y_6] : is_a_theorem(implies(X_5,implies(Y_6,X_5))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(not(X_3),Y_4))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_35,plain,
! [X_23,Y_24] : is_a_theorem(implies(implies(X_23,Y_24),implies(implies(not(X_23),Y_24),Y_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_34]) ).
tff(c_56,plain,
! [X_31,Y_32] :
( is_a_theorem(implies(implies(not(X_31),Y_32),Y_32))
| ~ is_a_theorem(implies(X_31,Y_32)) ),
inference(resolution,[status(thm)],[c_35,c_2]) ).
tff(c_61,plain,
! [Y_33,X_34] :
( is_a_theorem(Y_33)
| ~ is_a_theorem(implies(not(X_34),Y_33))
| ~ is_a_theorem(implies(X_34,Y_33)) ),
inference(resolution,[status(thm)],[c_56,c_2]) ).
tff(c_836,plain,
! [X_113,Y_114] :
( is_a_theorem(implies(not(not(X_113)),Y_114))
| ~ is_a_theorem(implies(X_113,implies(not(not(X_113)),Y_114))) ),
inference(resolution,[status(thm)],[c_4,c_61]) ).
tff(c_887,plain,
! [X_5] : is_a_theorem(implies(not(not(X_5)),X_5)),
inference(resolution,[status(thm)],[c_6,c_836]) ).
tff(c_14,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_890,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_887,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL043-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.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 14:20:37 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.74/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.74/1.95
% 3.74/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.74/1.98
% 3.74/1.98 Inference rules
% 3.74/1.98 ----------------------
% 3.74/1.98 #Ref : 0
% 3.74/1.98 #Sup : 212
% 3.74/1.98 #Fact : 0
% 3.74/1.98 #Define : 0
% 3.74/1.98 #Split : 2
% 3.74/1.98 #Chain : 0
% 3.74/1.98 #Close : 0
% 3.74/1.98
% 3.74/1.98 Ordering : KBO
% 3.74/1.98
% 3.74/1.98 Simplification rules
% 3.74/1.98 ----------------------
% 3.74/1.98 #Subsume : 88
% 3.74/1.98 #Demod : 19
% 3.74/1.98 #Tautology : 30
% 3.74/1.98 #SimpNegUnit : 0
% 3.74/1.98 #BackRed : 1
% 3.74/1.98
% 3.74/1.98 #Partial instantiations: 0
% 3.74/1.98 #Strategies tried : 1
% 3.74/1.98
% 3.74/1.98 Timing (in seconds)
% 3.74/1.98 ----------------------
% 3.74/1.98 Preprocessing : 0.40
% 3.74/1.98 Parsing : 0.22
% 3.74/1.98 CNF conversion : 0.02
% 3.74/1.98 Main loop : 0.53
% 3.74/1.98 Inferencing : 0.22
% 3.74/1.98 Reduction : 0.13
% 3.74/1.98 Demodulation : 0.09
% 3.74/1.98 BG Simplification : 0.02
% 3.74/1.98 Subsumption : 0.13
% 3.74/1.98 Abstraction : 0.02
% 3.74/1.98 MUC search : 0.00
% 3.74/1.98 Cooper : 0.00
% 3.74/1.98 Total : 0.97
% 3.74/1.98 Index Insertion : 0.00
% 3.74/1.98 Index Deletion : 0.00
% 3.74/1.98 Index Matching : 0.00
% 3.74/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------