TSTP Solution File: LCL013-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL013-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 : n029.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:11 EDT 2023
% Result : Unsatisfiable 2.16s 1.57s
% Output : CNFRefutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 17 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 8 |; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > 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(equivalent,type,
equivalent: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_35,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(X,Z)),equivalent(Z,Y)))),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_38,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4,Z_5] : is_a_theorem(equivalent(X_3,equivalent(equivalent(Y_4,equivalent(X_3,Z_5)),equivalent(Z_5,Y_4)))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8,plain,
! [X_8,Y_9,Z_10] : is_a_theorem(equivalent(X_8,equivalent(equivalent(Y_9,equivalent(X_8,Z_10)),equivalent(Z_10,Y_9)))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(equivalent(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_13,plain,
! [Y_11,X_12,Z_13] :
( is_a_theorem(equivalent(equivalent(Y_11,equivalent(X_12,Z_13)),equivalent(Z_13,Y_11)))
| ~ is_a_theorem(X_12) ),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_18,plain,
! [Z_14,Y_15,X_16] :
( is_a_theorem(equivalent(Z_14,Y_15))
| ~ is_a_theorem(equivalent(Y_15,equivalent(X_16,Z_14)))
| ~ is_a_theorem(X_16) ),
inference(resolution,[status(thm)],[c_13,c_2]) ).
tff(c_36,plain,
! [Z_20,Y_21,X_22] :
( is_a_theorem(equivalent(equivalent(Z_20,Y_21),X_22))
| ~ is_a_theorem(equivalent(Y_21,equivalent(X_22,Z_20))) ),
inference(resolution,[status(thm)],[c_4,c_18]) ).
tff(c_6,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_43,plain,
~ is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b)))),
inference(resolution,[status(thm)],[c_36,c_6]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 14:13:22 EDT 2023
% 0.16/0.34 % CPUTime :
% 2.16/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.16/1.58
% 2.16/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.16/1.61
% 2.16/1.61 Inference rules
% 2.16/1.61 ----------------------
% 2.16/1.61 #Ref : 0
% 2.16/1.61 #Sup : 9
% 2.16/1.61 #Fact : 0
% 2.16/1.61 #Define : 0
% 2.16/1.61 #Split : 0
% 2.16/1.61 #Chain : 0
% 2.16/1.61 #Close : 0
% 2.16/1.61
% 2.16/1.61 Ordering : KBO
% 2.16/1.61
% 2.16/1.61 Simplification rules
% 2.16/1.61 ----------------------
% 2.16/1.61 #Subsume : 0
% 2.16/1.61 #Demod : 1
% 2.16/1.61 #Tautology : 0
% 2.16/1.61 #SimpNegUnit : 0
% 2.16/1.61 #BackRed : 0
% 2.16/1.61
% 2.16/1.61 #Partial instantiations: 0
% 2.16/1.61 #Strategies tried : 1
% 2.16/1.61
% 2.16/1.61 Timing (in seconds)
% 2.16/1.61 ----------------------
% 2.16/1.62 Preprocessing : 0.38
% 2.16/1.62 Parsing : 0.21
% 2.16/1.62 CNF conversion : 0.02
% 2.16/1.62 Main loop : 0.17
% 2.16/1.62 Inferencing : 0.08
% 2.16/1.62 Reduction : 0.03
% 2.16/1.62 Demodulation : 0.03
% 2.16/1.62 BG Simplification : 0.01
% 2.16/1.62 Subsumption : 0.03
% 2.16/1.62 Abstraction : 0.01
% 2.16/1.62 MUC search : 0.00
% 2.16/1.62 Cooper : 0.00
% 2.16/1.62 Total : 0.60
% 2.16/1.62 Index Insertion : 0.00
% 2.16/1.62 Index Deletion : 0.00
% 2.16/1.62 Index Matching : 0.00
% 2.16/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------