TSTP Solution File: LCL007-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL007-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 : n031.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:09 EDT 2023
% Result : Unsatisfiable 3.01s 1.86s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 8 unt; 5 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 ( 4 avg)
% Maximal term depth : 4 ( 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 : 19 (; 19 !; 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_38,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(X,equivalent(Y,Z)))),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X,Y] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))),
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_40,axiom,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
file(unknown,unknown) ).
tff(c_20,plain,
! [X_14,Y_15,Z_16] : is_a_theorem(equivalent(equivalent(equivalent(X_14,Y_15),Z_16),equivalent(X_14,equivalent(Y_15,Z_16)))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(equivalent(equivalent(X_3,Y_4),equivalent(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_10,plain,
! [Y_10,X_11] :
( is_a_theorem(Y_10)
| ~ is_a_theorem(X_11)
| ~ is_a_theorem(equivalent(X_11,Y_10)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_14,plain,
! [Y_4,X_3] :
( is_a_theorem(equivalent(Y_4,X_3))
| ~ is_a_theorem(equivalent(X_3,Y_4)) ),
inference(resolution,[status(thm)],[c_4,c_10]) ).
tff(c_26,plain,
! [X_14,Y_15,Z_16] : is_a_theorem(equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),equivalent(equivalent(X_14,Y_15),Z_16))),
inference(resolution,[status(thm)],[c_20,c_14]) ).
tff(c_8,plain,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_420,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 14:04:44 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.01/1.86 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/1.86
% 3.01/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.15/1.90
% 3.15/1.90 Inference rules
% 3.15/1.90 ----------------------
% 3.15/1.90 #Ref : 0
% 3.15/1.90 #Sup : 92
% 3.15/1.90 #Fact : 0
% 3.15/1.90 #Define : 0
% 3.15/1.90 #Split : 0
% 3.15/1.90 #Chain : 0
% 3.15/1.90 #Close : 0
% 3.15/1.90
% 3.15/1.90 Ordering : KBO
% 3.15/1.90
% 3.15/1.90 Simplification rules
% 3.15/1.90 ----------------------
% 3.15/1.90 #Subsume : 28
% 3.15/1.90 #Demod : 11
% 3.15/1.90 #Tautology : 24
% 3.15/1.90 #SimpNegUnit : 0
% 3.15/1.90 #BackRed : 1
% 3.15/1.90
% 3.15/1.90 #Partial instantiations: 0
% 3.15/1.90 #Strategies tried : 1
% 3.15/1.90
% 3.15/1.90 Timing (in seconds)
% 3.15/1.90 ----------------------
% 3.15/1.90 Preprocessing : 0.39
% 3.15/1.90 Parsing : 0.21
% 3.15/1.90 CNF conversion : 0.02
% 3.15/1.90 Main loop : 0.36
% 3.15/1.90 Inferencing : 0.15
% 3.15/1.90 Reduction : 0.09
% 3.15/1.90 Demodulation : 0.07
% 3.15/1.90 BG Simplification : 0.01
% 3.15/1.90 Subsumption : 0.08
% 3.15/1.90 Abstraction : 0.01
% 3.15/1.90 MUC search : 0.00
% 3.15/1.90 Cooper : 0.00
% 3.15/1.90 Total : 0.80
% 3.15/1.90 Index Insertion : 0.00
% 3.15/1.90 Index Deletion : 0.00
% 3.15/1.90 Index Matching : 0.00
% 3.15/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------