TSTP Solution File: SYN065-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN065-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 : n025.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:09:13 EDT 2023
% Result : Unsatisfiable 2.65s 1.68s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 15 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > big_g > big_f > #nlpp > g > f > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(big_h,type,
big_h: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_24,axiom,
! [X] : big_f(X,f(X)),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y,Z] :
( ~ big_f(X,Y)
| ~ big_f(Y,Z)
| big_h(X,Z) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] : ~ big_h(a,X),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : big_f(X_1,f(X_1)),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_18,plain,
! [X_19,Z_20,Y_21] :
( big_h(X_19,Z_20)
| ~ big_f(Y_21,Z_20)
| ~ big_f(X_19,Y_21) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_22,plain,
! [X_22,X_23] :
( big_h(X_22,f(X_23))
| ~ big_f(X_22,X_23) ),
inference(resolution,[status(thm)],[c_2,c_18]) ).
tff(c_14,plain,
! [X_15] : ~ big_h(a,X_15),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_32,plain,
! [X_27] : ~ big_f(a,X_27),
inference(resolution,[status(thm)],[c_22,c_14]) ).
tff(c_37,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN065-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 : n025.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 17:33:19 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.65/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.65/1.68
% 2.65/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.65/1.71
% 2.65/1.71 Inference rules
% 2.65/1.71 ----------------------
% 2.65/1.71 #Ref : 0
% 2.65/1.71 #Sup : 4
% 2.65/1.71 #Fact : 0
% 2.65/1.71 #Define : 0
% 2.65/1.71 #Split : 0
% 2.65/1.71 #Chain : 0
% 2.65/1.71 #Close : 0
% 2.65/1.71
% 2.65/1.71 Ordering : KBO
% 2.65/1.71
% 2.65/1.71 Simplification rules
% 2.65/1.71 ----------------------
% 2.65/1.71 #Subsume : 0
% 2.65/1.71 #Demod : 0
% 2.65/1.71 #Tautology : 0
% 2.65/1.71 #SimpNegUnit : 0
% 2.65/1.71 #BackRed : 0
% 2.65/1.71
% 2.65/1.71 #Partial instantiations: 0
% 2.65/1.71 #Strategies tried : 1
% 2.65/1.71
% 2.65/1.71 Timing (in seconds)
% 2.65/1.71 ----------------------
% 2.65/1.71 Preprocessing : 0.41
% 2.65/1.71 Parsing : 0.23
% 2.65/1.71 CNF conversion : 0.02
% 2.65/1.72 Main loop : 0.14
% 2.65/1.72 Inferencing : 0.06
% 2.65/1.72 Reduction : 0.03
% 2.65/1.72 Demodulation : 0.02
% 2.65/1.72 BG Simplification : 0.01
% 2.65/1.72 Subsumption : 0.03
% 2.65/1.72 Abstraction : 0.01
% 2.65/1.72 MUC search : 0.00
% 2.65/1.72 Cooper : 0.00
% 2.65/1.72 Total : 0.60
% 2.65/1.72 Index Insertion : 0.00
% 2.65/1.72 Index Deletion : 0.00
% 2.65/1.72 Index Matching : 0.00
% 2.65/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------