TSTP Solution File: SYN349-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN349-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 : n010.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:33 EDT 2023
% Result : Unsatisfiable 2.81s 1.79s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 72 ( 31 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > g > #nlpp > w
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(g,type,
g: ( $i * $i ) > $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(w,type,
w: $i > $i ).
tff(f_64,axiom,
! [X,Y] :
( f(X,g(X,Y))
| f(g(X,Y),Y)
| f(Y,g(X,Y))
| f(g(X,Y),w(X)) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [X,Y] :
( f(X,g(X,Y))
| ~ f(g(X,Y),Y)
| f(Y,g(X,Y))
| ~ f(g(X,Y),w(X)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( f(X,g(X,Y))
| ~ f(w(X),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] :
( ~ f(X,g(X,Y))
| f(w(X),g(X,Y)) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] :
( ~ f(X,g(X,Y))
| f(g(X,Y),Y)
| ~ f(Y,g(X,Y))
| f(g(X,Y),w(X)) ),
file(unknown,unknown) ).
tff(f_116,axiom,
! [X,Y] :
( ~ f(X,g(X,Y))
| ~ f(g(X,Y),Y)
| ~ f(Y,g(X,Y))
| ~ f(g(X,Y),w(X)) ),
file(unknown,unknown) ).
tff(c_10,plain,
! [X_9,Y_10] :
( f(g(X_9,Y_10),w(X_9))
| f(Y_10,g(X_9,Y_10))
| f(g(X_9,Y_10),Y_10)
| f(X_9,g(X_9,Y_10)) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_80,plain,
! [X_9] :
( f(w(X_9),g(X_9,w(X_9)))
| f(X_9,g(X_9,w(X_9)))
| f(g(X_9,w(X_9)),w(X_9)) ),
inference(factorization,[status(thm),theory(equality)],[c_10]) ).
tff(c_106,plain,
! [X_38] :
( f(w(X_38),g(X_38,w(X_38)))
| f(X_38,g(X_38,w(X_38)))
| f(g(X_38,w(X_38)),w(X_38)) ),
inference(factorization,[status(thm),theory(equality)],[c_10]) ).
tff(c_16,plain,
! [X_15,Y_16] :
( ~ f(g(X_15,Y_16),w(X_15))
| f(Y_16,g(X_15,Y_16))
| ~ f(g(X_15,Y_16),Y_16)
| f(X_15,g(X_15,Y_16)) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_119,plain,
! [X_39] :
( ~ f(g(X_39,w(X_39)),w(X_39))
| f(w(X_39),g(X_39,w(X_39)))
| f(X_39,g(X_39,w(X_39))) ),
inference(resolution,[status(thm)],[c_106,c_16]) ).
tff(c_136,plain,
! [X_40] :
( f(w(X_40),g(X_40,w(X_40)))
| f(X_40,g(X_40,w(X_40))) ),
inference(resolution,[status(thm)],[c_80,c_119]) ).
tff(c_2,plain,
! [X_1,Y_2] :
( ~ f(w(X_1),g(X_1,Y_2))
| f(X_1,g(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_140,plain,
! [X_40] : f(X_40,g(X_40,w(X_40))),
inference(resolution,[status(thm)],[c_136,c_2]) ).
tff(c_4,plain,
! [X_3,Y_4] :
( f(w(X_3),g(X_3,Y_4))
| ~ f(X_3,g(X_3,Y_4)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_6,plain,
! [X_5,Y_6] :
( f(g(X_5,Y_6),w(X_5))
| ~ f(Y_6,g(X_5,Y_6))
| f(g(X_5,Y_6),Y_6)
| ~ f(X_5,g(X_5,Y_6)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_40,plain,
! [X_5] :
( ~ f(w(X_5),g(X_5,w(X_5)))
| ~ f(X_5,g(X_5,w(X_5)))
| f(g(X_5,w(X_5)),w(X_5)) ),
inference(factorization,[status(thm),theory(equality)],[c_6]) ).
tff(c_143,plain,
! [X_5] :
( ~ f(w(X_5),g(X_5,w(X_5)))
| f(g(X_5,w(X_5)),w(X_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_40]) ).
tff(c_177,plain,
! [X_45,Y_46] :
( ~ f(g(X_45,Y_46),w(X_45))
| ~ f(Y_46,g(X_45,Y_46))
| ~ f(g(X_45,Y_46),Y_46)
| ~ f(X_45,g(X_45,Y_46)) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_179,plain,
! [X_5] :
( ~ f(g(X_5,w(X_5)),w(X_5))
| ~ f(X_5,g(X_5,w(X_5)))
| ~ f(w(X_5),g(X_5,w(X_5))) ),
inference(resolution,[status(thm)],[c_143,c_177]) ).
tff(c_191,plain,
! [X_47] :
( ~ f(g(X_47,w(X_47)),w(X_47))
| ~ f(w(X_47),g(X_47,w(X_47))) ),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_179]) ).
tff(c_204,plain,
! [X_48] : ~ f(w(X_48),g(X_48,w(X_48))),
inference(resolution,[status(thm)],[c_143,c_191]) ).
tff(c_208,plain,
! [X_3] : ~ f(X_3,g(X_3,w(X_3))),
inference(resolution,[status(thm)],[c_4,c_204]) ).
tff(c_212,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_140,c_208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN349-1 : TPTP v8.1.2. Released v1.2.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.14/0.35 % Computer : n010.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 16:57:13 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.81/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.80
% 2.81/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.32/1.84
% 3.32/1.84 Inference rules
% 3.32/1.84 ----------------------
% 3.32/1.84 #Ref : 0
% 3.32/1.84 #Sup : 32
% 3.32/1.84 #Fact : 4
% 3.32/1.84 #Define : 0
% 3.32/1.84 #Split : 0
% 3.32/1.84 #Chain : 0
% 3.32/1.84 #Close : 0
% 3.32/1.84
% 3.32/1.84 Ordering : KBO
% 3.32/1.84
% 3.32/1.84 Simplification rules
% 3.32/1.84 ----------------------
% 3.32/1.84 #Subsume : 18
% 3.32/1.84 #Demod : 9
% 3.32/1.84 #Tautology : 15
% 3.32/1.84 #SimpNegUnit : 0
% 3.32/1.84 #BackRed : 1
% 3.32/1.84
% 3.32/1.84 #Partial instantiations: 0
% 3.32/1.84 #Strategies tried : 1
% 3.32/1.84
% 3.32/1.84 Timing (in seconds)
% 3.32/1.84 ----------------------
% 3.39/1.84 Preprocessing : 0.45
% 3.39/1.84 Parsing : 0.25
% 3.39/1.84 CNF conversion : 0.02
% 3.39/1.84 Main loop : 0.29
% 3.39/1.84 Inferencing : 0.15
% 3.39/1.84 Reduction : 0.04
% 3.39/1.84 Demodulation : 0.03
% 3.39/1.84 BG Simplification : 0.02
% 3.39/1.84 Subsumption : 0.07
% 3.39/1.84 Abstraction : 0.01
% 3.39/1.84 MUC search : 0.00
% 3.39/1.84 Cooper : 0.00
% 3.39/1.84 Total : 0.80
% 3.39/1.84 Index Insertion : 0.00
% 3.39/1.84 Index Deletion : 0.00
% 3.39/1.84 Index Matching : 0.00
% 3.39/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------