TSTP Solution File: LCL076-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL076-2 : 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 : n004.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 2.56s 1.62s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 15 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 13 (; 13 !; 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_44,axiom,
! [X1] : is_a_theorem(implies(not(not(X1)),X1)),
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_36,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(a,not(not(a)))),
file(unknown,unknown) ).
tff(c_10,plain,
! [X1_10] : is_a_theorem(implies(not(not(X1_10)),X1_10)),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_33,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_42]) ).
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_39,plain,
! [Y_21,X_22] :
( is_a_theorem(implies(Y_21,X_22))
| ~ is_a_theorem(implies(not(X_22),not(Y_21))) ),
inference(resolution,[status(thm)],[c_33,c_2]) ).
tff(c_48,plain,
! [Y_21] : is_a_theorem(implies(Y_21,not(not(Y_21)))),
inference(resolution,[status(thm)],[c_10,c_39]) ).
tff(c_12,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL076-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 14:00:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.56/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.56/1.63
% 2.56/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.56/1.66
% 2.56/1.66 Inference rules
% 2.56/1.66 ----------------------
% 2.56/1.66 #Ref : 0
% 2.56/1.66 #Sup : 8
% 2.56/1.66 #Fact : 0
% 2.56/1.66 #Define : 0
% 2.56/1.66 #Split : 0
% 2.56/1.66 #Chain : 0
% 2.56/1.66 #Close : 0
% 2.56/1.66
% 2.56/1.66 Ordering : KBO
% 2.56/1.66
% 2.56/1.66 Simplification rules
% 2.56/1.66 ----------------------
% 2.56/1.66 #Subsume : 0
% 2.56/1.66 #Demod : 1
% 2.56/1.66 #Tautology : 1
% 2.56/1.66 #SimpNegUnit : 0
% 2.56/1.66 #BackRed : 1
% 2.56/1.66
% 2.56/1.66 #Partial instantiations: 0
% 2.56/1.66 #Strategies tried : 1
% 2.56/1.66
% 2.56/1.66 Timing (in seconds)
% 2.56/1.66 ----------------------
% 2.77/1.66 Preprocessing : 0.42
% 2.77/1.66 Parsing : 0.23
% 2.77/1.66 CNF conversion : 0.02
% 2.77/1.66 Main loop : 0.18
% 2.77/1.66 Inferencing : 0.08
% 2.77/1.66 Reduction : 0.04
% 2.77/1.66 Demodulation : 0.03
% 2.77/1.66 BG Simplification : 0.01
% 2.77/1.66 Subsumption : 0.04
% 2.77/1.66 Abstraction : 0.01
% 2.77/1.66 MUC search : 0.00
% 2.77/1.66 Cooper : 0.00
% 2.77/1.66 Total : 0.64
% 2.77/1.66 Index Insertion : 0.00
% 2.77/1.67 Index Deletion : 0.00
% 2.77/1.67 Index Matching : 0.00
% 2.77/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------