TSTP Solution File: SYN033-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN033-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 : n009.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 11:08:33 EDT 2023
% Result : Unsatisfiable 2.44s 1.64s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-2 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > h > g > #nlpp > k
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: ( $i * $i ) > $i ).
tff(g,type,
g: ( $i * $i ) > $i ).
tff(p,type,
p: ( $i * $i * $i ) > $o ).
tff(k,type,
k: $i > $i ).
tff(f_25,axiom,
! [A,B] : p(g(A,B),A,B),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : p(A,h(A,B),B),
file(unknown,unknown) ).
tff(f_38,axiom,
! [A,F,B,C,E,D] :
( ~ p(A,B,C)
| ~ p(D,E,B)
| ~ p(A,D,F)
| p(F,E,C) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A] : ~ p(k(A),A,k(A)),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2] : p(g(A_1,B_2),A_1,B_2),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_4,plain,
! [A_3,B_4] : p(A_3,h(A_3,B_4),B_4),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_12,plain,
! [E_22,F_18,A_20,B_21,C_19,D_17] :
( p(F_18,E_22,C_19)
| ~ p(A_20,D_17,F_18)
| ~ p(D_17,E_22,B_21)
| ~ p(A_20,B_21,C_19) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_24,plain,
! [E_30,B_29,B_31,A_32,C_28] :
( p(B_31,E_30,C_28)
| ~ p(A_32,E_30,B_29)
| ~ p(g(A_32,B_31),B_29,C_28) ),
inference(resolution,[status(thm)],[c_2,c_12]) ).
tff(c_43,plain,
! [B_41,A_42,B_43,C_44] :
( p(B_41,h(A_42,B_43),C_44)
| ~ p(g(A_42,B_41),B_43,C_44) ),
inference(resolution,[status(thm)],[c_4,c_24]) ).
tff(c_58,plain,
! [B_45,A_46] : p(B_45,h(A_46,A_46),B_45),
inference(resolution,[status(thm)],[c_2,c_43]) ).
tff(c_8,plain,
! [A_11] : ~ p(k(A_11),A_11,k(A_11)),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_83,plain,
$false,
inference(resolution,[status(thm)],[c_58,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN033-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % 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.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 3 17:06:53 EDT 2023
% 0.11/0.33 % CPUTime :
% 2.44/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.63/1.64
% 2.63/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.63/1.68
% 2.63/1.68 Inference rules
% 2.63/1.68 ----------------------
% 2.63/1.68 #Ref : 0
% 2.63/1.68 #Sup : 17
% 2.63/1.68 #Fact : 0
% 2.63/1.68 #Define : 0
% 2.63/1.68 #Split : 0
% 2.63/1.68 #Chain : 0
% 2.63/1.68 #Close : 0
% 2.63/1.68
% 2.63/1.68 Ordering : KBO
% 2.63/1.68
% 2.63/1.68 Simplification rules
% 2.63/1.68 ----------------------
% 2.63/1.68 #Subsume : 0
% 2.63/1.68 #Demod : 0
% 2.63/1.68 #Tautology : 0
% 2.63/1.68 #SimpNegUnit : 0
% 2.63/1.68 #BackRed : 0
% 2.63/1.68
% 2.63/1.68 #Partial instantiations: 0
% 2.63/1.68 #Strategies tried : 1
% 2.63/1.68
% 2.63/1.68 Timing (in seconds)
% 2.63/1.68 ----------------------
% 2.63/1.68 Preprocessing : 0.38
% 2.63/1.68 Parsing : 0.21
% 2.63/1.68 CNF conversion : 0.02
% 2.63/1.68 Main loop : 0.20
% 2.63/1.68 Inferencing : 0.08
% 2.63/1.68 Reduction : 0.04
% 2.63/1.68 Demodulation : 0.03
% 2.63/1.68 BG Simplification : 0.01
% 2.63/1.68 Subsumption : 0.05
% 2.63/1.68 Abstraction : 0.01
% 2.63/1.68 MUC search : 0.00
% 2.63/1.68 Cooper : 0.00
% 2.63/1.68 Total : 0.63
% 2.63/1.68 Index Insertion : 0.00
% 2.63/1.68 Index Deletion : 0.00
% 2.63/1.68 Index Matching : 0.00
% 2.63/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------