TSTP Solution File: SYN319-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN319-1 : TPTP v8.1.2. Released v1.2.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 : n017.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:10:24 EDT 2023
% Result : Unsatisfiable 2.30s 1.55s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ h > g > f > z2 > z1 > #nlpp > y
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: $i > $o ).
tff(z1,type,
z1: ( $i * $i ) > $i ).
tff(y,type,
y: $i ).
tff(g,type,
g: $i > $o ).
tff(z2,type,
z2: ( $i * $i ) > $i ).
tff(f,type,
f: $i > $o ).
tff(f_30,axiom,
! [Y,X] :
( f(Y)
| g(X) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] :
( ~ f(X)
| h(X) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y] : ~ h(z2(X,Y)),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] :
( ~ g(X)
| h(X) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_2,Y_1] :
( g(X_2)
| f(Y_1) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_16,plain,
! [Y_1] : f(Y_1),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_10,plain,
! [X_8] :
( h(X_8)
| ~ f(X_8) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_19,plain,
! [X_8] : h(X_8),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_10]) ).
tff(c_14,plain,
! [X_10,Y_11] : ~ h(z2(X_10,Y_11)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_22,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_14]) ).
tff(c_23,plain,
! [X_2] : g(X_2),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_12,plain,
! [X_9] :
( h(X_9)
| ~ g(X_9) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_31,plain,
! [X_9] : h(X_9),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_12]) ).
tff(c_35,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_31,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN319-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 16:39:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.30/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.30/1.55
% 2.30/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.30/1.58
% 2.30/1.58 Inference rules
% 2.30/1.58 ----------------------
% 2.30/1.58 #Ref : 0
% 2.30/1.58 #Sup : 1
% 2.30/1.58 #Fact : 0
% 2.30/1.58 #Define : 0
% 2.30/1.58 #Split : 1
% 2.30/1.58 #Chain : 0
% 2.30/1.58 #Close : 0
% 2.30/1.58
% 2.30/1.58 Ordering : KBO
% 2.30/1.58
% 2.30/1.58 Simplification rules
% 2.30/1.58 ----------------------
% 2.30/1.58 #Subsume : 0
% 2.30/1.58 #Demod : 5
% 2.30/1.58 #Tautology : 1
% 2.30/1.58 #SimpNegUnit : 0
% 2.30/1.58 #BackRed : 2
% 2.30/1.58
% 2.30/1.58 #Partial instantiations: 0
% 2.30/1.58 #Strategies tried : 1
% 2.30/1.58
% 2.30/1.58 Timing (in seconds)
% 2.30/1.58 ----------------------
% 2.58/1.58 Preprocessing : 0.39
% 2.58/1.58 Parsing : 0.21
% 2.58/1.58 CNF conversion : 0.02
% 2.58/1.58 Main loop : 0.15
% 2.58/1.58 Inferencing : 0.07
% 2.58/1.58 Reduction : 0.03
% 2.58/1.58 Demodulation : 0.02
% 2.58/1.58 BG Simplification : 0.01
% 2.58/1.58 Subsumption : 0.03
% 2.58/1.58 Abstraction : 0.00
% 2.58/1.58 MUC search : 0.00
% 2.58/1.58 Cooper : 0.00
% 2.58/1.58 Total : 0.59
% 2.58/1.58 Index Insertion : 0.00
% 2.58/1.58 Index Deletion : 0.00
% 2.58/1.58 Index Matching : 0.00
% 2.58/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------