TSTP Solution File: SYN326-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN326-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/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 : n003.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:26 EDT 2023
% Result : Unsatisfiable 2.45s 1.60s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 17 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 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 : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > h > g > #nlpp > z > y
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(z,type,
z: $i > $i ).
tff(h,type,
h: $i > $o ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(y,type,
y: $i > $i ).
tff(g,type,
g: $i > $o ).
tff(f_39,axiom,
! [X] :
( ~ h(X)
| f(X,X) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] : ~ f(z(X),z(X)),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X] :
( ~ g(X)
| h(z(X)) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] :
( g(y(X))
| f(X,X) ),
file(unknown,unknown) ).
tff(c_17,plain,
! [X_10] :
( f(X_10,X_10)
| ~ h(X_10) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_14,plain,
! [X_7] : ~ f(z(X_7),z(X_7)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_21,plain,
! [X_7] : ~ h(z(X_7)),
inference(resolution,[status(thm)],[c_17,c_14]) ).
tff(c_10,plain,
! [X_5] :
( h(z(X_5))
| ~ g(X_5) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_23,plain,
! [X_5] : ~ g(X_5),
inference(negUnitSimplification,[status(thm)],[c_21,c_10]) ).
tff(c_4,plain,
! [X_2] :
( f(X_2,X_2)
| g(y(X_2)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_25,plain,
! [X_2] : f(X_2,X_2),
inference(negUnitSimplification,[status(thm)],[c_23,c_4]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_25,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% 0.09/0.15 % 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.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:31:08 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.45/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.60
% 2.45/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.57/1.63
% 2.57/1.63 Inference rules
% 2.57/1.63 ----------------------
% 2.57/1.63 #Ref : 0
% 2.57/1.63 #Sup : 1
% 2.57/1.63 #Fact : 0
% 2.57/1.63 #Define : 0
% 2.57/1.63 #Split : 0
% 2.57/1.63 #Chain : 0
% 2.57/1.63 #Close : 0
% 2.57/1.63
% 2.57/1.63 Ordering : KBO
% 2.57/1.63
% 2.57/1.63 Simplification rules
% 2.57/1.63 ----------------------
% 2.57/1.63 #Subsume : 0
% 2.57/1.63 #Demod : 2
% 2.57/1.63 #Tautology : 1
% 2.57/1.63 #SimpNegUnit : 2
% 2.57/1.63 #BackRed : 1
% 2.57/1.63
% 2.57/1.63 #Partial instantiations: 0
% 2.57/1.63 #Strategies tried : 1
% 2.57/1.63
% 2.57/1.63 Timing (in seconds)
% 2.57/1.63 ----------------------
% 2.57/1.63 Preprocessing : 0.41
% 2.57/1.63 Parsing : 0.22
% 2.57/1.63 CNF conversion : 0.02
% 2.57/1.63 Main loop : 0.15
% 2.57/1.63 Inferencing : 0.07
% 2.57/1.63 Reduction : 0.03
% 2.57/1.63 Demodulation : 0.02
% 2.57/1.63 BG Simplification : 0.01
% 2.57/1.63 Subsumption : 0.03
% 2.57/1.63 Abstraction : 0.00
% 2.57/1.63 MUC search : 0.00
% 2.57/1.63 Cooper : 0.00
% 2.57/1.63 Total : 0.60
% 2.57/1.63 Index Insertion : 0.00
% 2.57/1.63 Index Deletion : 0.00
% 2.57/1.63 Index Matching : 0.00
% 2.57/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------