TSTP Solution File: SYN074-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN074-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 : n008.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:30 EDT 2023
% Result : Unsatisfiable 3.51s 1.87s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 67 ( 51 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 43 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 (; 41 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > h > #nlpp > g > f > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: ( $i * $i ) > $i ).
tff(a,type,
a: $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(b,type,
b: $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_82,axiom,
! [Y,X] :
( ( Y != g(X) )
| big_f(f(X),Y)
| ( f(X) = X ) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| ( X = a ) ),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Z] :
( ( f(X) != X )
| big_f(f(X),h(X,Z))
| ( h(X,Z) = Z ) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| ( Y = b ) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] :
( ( X != a )
| ( Y != b )
| big_f(X,Y) ),
file(unknown,unknown) ).
tff(f_109,axiom,
! [X,Z] :
( ( f(X) != X )
| ( h(X,Z) != Z )
| ~ big_f(f(X),h(X,Z)) ),
file(unknown,unknown) ).
tff(c_35,plain,
! [X_31] :
( ( f(X_31) = X_31 )
| big_f(f(X_31),g(X_31)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_2,plain,
! [X_1,Y_2] :
( ( a = X_1 )
| ~ big_f(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_42,plain,
! [X_31] :
( ( f(X_31) = a )
| ( f(X_31) = X_31 ) ),
inference(resolution,[status(thm)],[c_35,c_2]) ).
tff(c_47,plain,
! [X_31] :
( ( f(X_31) = X_31 )
| ( a != X_31 ) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_178,plain,
! [X_38,Z_39] :
( ( h(X_38,Z_39) = Z_39 )
| big_f(f(X_38),h(X_38,Z_39))
| ( f(X_38) != X_38 ) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_4,plain,
! [Y_4,X_3] :
( ( b = Y_4 )
| ~ big_f(X_3,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_202,plain,
! [X_38,Z_39] :
( ( h(X_38,Z_39) = b )
| ( h(X_38,Z_39) = Z_39 )
| ( f(X_38) != X_38 ) ),
inference(resolution,[status(thm)],[c_178,c_4]) ).
tff(c_262,plain,
! [X_38,Z_39] :
( ( f(X_38) != X_38 )
| ( h(X_38,Z_39) = Z_39 )
| ( b != Z_39 ) ),
inference(factorization,[status(thm),theory(equality)],[c_202]) ).
tff(c_6,plain,
big_f(a,b),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_267,plain,
! [X_38,Z_39] :
( ( f(X_38) != X_38 )
| ( h(X_38,Z_39) = b )
| ( b != Z_39 ) ),
inference(factorization,[status(thm),theory(equality)],[c_202]) ).
tff(c_52,plain,
! [X_31] :
( ( f(X_31) = a )
| ( a != X_31 ) ),
inference(factorization,[status(thm),theory(equality)],[c_42]) ).
tff(c_318,plain,
! [X_46,Z_47] :
( ~ big_f(f(X_46),h(X_46,Z_47))
| ( h(X_46,Z_47) != Z_47 )
| ( f(X_46) != X_46 ) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_568,plain,
! [X_62,Z_63] :
( ~ big_f(a,h(X_62,Z_63))
| ( h(X_62,Z_63) != Z_63 )
| ( f(X_62) != X_62 )
| ( a != X_62 ) ),
inference(superposition,[status(thm),theory(equality)],[c_52,c_318]) ).
tff(c_577,plain,
! [X_38,Z_39] :
( ~ big_f(a,b)
| ( h(X_38,Z_39) != Z_39 )
| ( f(X_38) != X_38 )
| ( a != X_38 )
| ( f(X_38) != X_38 )
| ( b != Z_39 ) ),
inference(superposition,[status(thm),theory(equality)],[c_267,c_568]) ).
tff(c_641,plain,
! [X_66,Z_67] :
( ( h(X_66,Z_67) != Z_67 )
| ( a != X_66 )
| ( f(X_66) != X_66 )
| ( b != Z_67 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_577]) ).
tff(c_657,plain,
! [X_38,Z_39] :
( ( a != X_38 )
| ( f(X_38) != X_38 )
| ( b != Z_39 ) ),
inference(superposition,[status(thm),theory(equality)],[c_262,c_641]) ).
tff(c_660,plain,
! [Z_39] : ( b != Z_39 ),
inference(splitLeft,[status(thm)],[c_657]) ).
tff(c_668,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_660]) ).
tff(c_696,plain,
! [X_71] :
( ( a != X_71 )
| ( f(X_71) != X_71 ) ),
inference(splitRight,[status(thm)],[c_657]) ).
tff(c_709,plain,
! [X_31] : ( a != X_31 ),
inference(superposition,[status(thm),theory(equality)],[c_47,c_696]) ).
tff(c_718,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_709]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN074-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/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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:31:34 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.51/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.51/1.87
% 3.51/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.65/1.90
% 3.65/1.90 Inference rules
% 3.65/1.90 ----------------------
% 3.65/1.90 #Ref : 2
% 3.65/1.90 #Sup : 184
% 3.65/1.90 #Fact : 4
% 3.65/1.90 #Define : 0
% 3.65/1.90 #Split : 1
% 3.65/1.90 #Chain : 0
% 3.65/1.90 #Close : 0
% 3.65/1.90
% 3.65/1.90 Ordering : KBO
% 3.65/1.90
% 3.65/1.90 Simplification rules
% 3.65/1.90 ----------------------
% 3.65/1.90 #Subsume : 84
% 3.65/1.90 #Demod : 8
% 3.65/1.90 #Tautology : 59
% 3.65/1.90 #SimpNegUnit : 8
% 3.65/1.90 #BackRed : 6
% 3.65/1.90
% 3.65/1.90 #Partial instantiations: 0
% 3.65/1.90 #Strategies tried : 1
% 3.65/1.90
% 3.65/1.90 Timing (in seconds)
% 3.65/1.90 ----------------------
% 3.65/1.90 Preprocessing : 0.44
% 3.65/1.90 Parsing : 0.23
% 3.65/1.90 CNF conversion : 0.02
% 3.65/1.90 Main loop : 0.40
% 3.65/1.90 Inferencing : 0.16
% 3.65/1.90 Reduction : 0.09
% 3.65/1.90 Demodulation : 0.06
% 3.65/1.90 BG Simplification : 0.03
% 3.65/1.90 Subsumption : 0.09
% 3.65/1.90 Abstraction : 0.02
% 3.65/1.90 MUC search : 0.00
% 3.65/1.91 Cooper : 0.00
% 3.65/1.91 Total : 0.88
% 3.65/1.91 Index Insertion : 0.00
% 3.65/1.91 Index Deletion : 0.00
% 3.65/1.91 Index Matching : 0.00
% 3.65/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------