TSTP Solution File: SYN333-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN333-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 : 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:10:28 EDT 2023
% Result : Unsatisfiable 1.87s 1.51s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 12 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ g > f > z > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: ( $i * $i ) > $o ).
tff(g,type,
g: ( $i * $i ) > $o ).
tff(z,type,
z: ( $i * $i ) > $i ).
tff(f_28,axiom,
! [X,Y] : f(X,Y),
file(unknown,unknown) ).
tff(f_36,axiom,
! [Y,X] :
( ~ f(Y,z(X,Y))
| ~ f(z(X,Y),z(X,Y))
| g(X,Y) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [Y,X] :
( ~ f(Y,z(X,Y))
| ~ f(z(X,Y),z(X,Y))
| ~ g(X,z(X,Y))
| ~ g(z(X,Y),z(X,Y)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2] : f(X_1,Y_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_4,plain,
! [X_4,Y_3] :
( g(X_4,Y_3)
| ~ f(z(X_4,Y_3),z(X_4,Y_3))
| ~ f(Y_3,z(X_4,Y_3)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_8,plain,
! [X_4,Y_3] : g(X_4,Y_3),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_4]) ).
tff(c_6,plain,
! [X_6,Y_5] :
( ~ g(z(X_6,Y_5),z(X_6,Y_5))
| ~ g(X_6,z(X_6,Y_5))
| ~ f(z(X_6,Y_5),z(X_6,Y_5))
| ~ f(Y_5,z(X_6,Y_5)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_10,plain,
! [X_6,Y_5] :
( ~ g(z(X_6,Y_5),z(X_6,Y_5))
| ~ g(X_6,z(X_6,Y_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_6]) ).
tff(c_12,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN333-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.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:24:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 1.87/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.87/1.51
% 1.87/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.25/1.55
% 2.25/1.55 Inference rules
% 2.25/1.55 ----------------------
% 2.25/1.55 #Ref : 0
% 2.25/1.55 #Sup : 0
% 2.25/1.55 #Fact : 0
% 2.25/1.55 #Define : 0
% 2.25/1.55 #Split : 0
% 2.25/1.55 #Chain : 0
% 2.25/1.55 #Close : 0
% 2.25/1.55
% 2.25/1.55 Ordering : KBO
% 2.25/1.55
% 2.25/1.55 Simplification rules
% 2.25/1.55 ----------------------
% 2.25/1.55 #Subsume : 2
% 2.25/1.55 #Demod : 6
% 2.25/1.55 #Tautology : 0
% 2.25/1.55 #SimpNegUnit : 0
% 2.25/1.55 #BackRed : 0
% 2.25/1.55
% 2.25/1.55 #Partial instantiations: 0
% 2.25/1.55 #Strategies tried : 1
% 2.25/1.55
% 2.25/1.55 Timing (in seconds)
% 2.25/1.55 ----------------------
% 2.25/1.56 Preprocessing : 0.38
% 2.25/1.56 Parsing : 0.21
% 2.25/1.56 CNF conversion : 0.02
% 2.25/1.56 Main loop : 0.05
% 2.25/1.56 Inferencing : 0.00
% 2.25/1.56 Reduction : 0.02
% 2.25/1.56 Demodulation : 0.02
% 2.25/1.56 BG Simplification : 0.01
% 2.25/1.56 Subsumption : 0.02
% 2.25/1.56 Abstraction : 0.00
% 2.25/1.56 MUC search : 0.00
% 2.25/1.56 Cooper : 0.00
% 2.25/1.56 Total : 0.49
% 2.25/1.56 Index Insertion : 0.00
% 2.25/1.56 Index Deletion : 0.00
% 2.25/1.56 Index Matching : 0.00
% 2.25/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------