TSTP Solution File: SWV866-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV866-1 : TPTP v8.1.2. Released v4.1.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 : n018.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:05:50 EDT 2023
% Result : Unsatisfiable 2.86s 1.65s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 26 ( 7 unt; 17 typ; 0 def)
% Number of atoms : 11 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 8 >; 17 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-5 aty)
% Number of variables : 2 (; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_Natural_Oevaln > c_Natural_Oevalc > c_Natural_Osko__Natural__Xevaln__elim__cases__4__1 > c_Natural_Osko__Natural__Xevalc__elim__cases__4__1 > c_Natural_Osko__Natural__Xevalc__evaln__1__1 > c_Natural_Osko__Natural__Xeval__eq__1__1 > c_Com_Ocom_OSemi > #nlpp > v_sko__Hoare__Mirabelle__Xsingle__stateE__1 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 > v_s_H > v_c > v_Z > c_Hoare__Mirabelle_Ostate__not__singleton > c_Com_Ocom_OSKIP
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Natural_Osko__Natural__Xevalc__elim__cases__4__1,type,
c_Natural_Osko__Natural__Xevalc__elim__cases__4__1: ( $i * $i * $i * $i ) > $i ).
tff(v_c,type,
v_c: $i ).
tff(c_Natural_Osko__Natural__Xevaln__elim__cases__4__1,type,
c_Natural_Osko__Natural__Xevaln__elim__cases__4__1: ( $i * $i * $i * $i * $i ) > $i ).
tff(v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1,type,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1: $i ).
tff(c_Natural_Osko__Natural__Xeval__eq__1__1,type,
c_Natural_Osko__Natural__Xeval__eq__1__1: ( $i * $i * $i ) > $i ).
tff(c_Natural_Oevalc,type,
c_Natural_Oevalc: ( $i * $i * $i ) > $o ).
tff(c_Com_Ocom_OSKIP,type,
c_Com_Ocom_OSKIP: $i ).
tff(c_Hoare__Mirabelle_Ostate__not__singleton,type,
c_Hoare__Mirabelle_Ostate__not__singleton: $o ).
tff(v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1,type,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1: $i ).
tff(c_Natural_Osko__Natural__Xevalc__evaln__1__1,type,
c_Natural_Osko__Natural__Xevalc__evaln__1__1: ( $i * $i * $i ) > $i ).
tff(v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2,type,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2: $i ).
tff(v_s_H,type,
v_s_H: $i ).
tff(v_Z,type,
v_Z: $i ).
tff(v_sko__Hoare__Mirabelle__Xsingle__stateE__1,type,
v_sko__Hoare__Mirabelle__Xsingle__stateE__1: $i > $i ).
tff(c_Com_Ocom_OSemi,type,
c_Com_Ocom_OSemi: ( $i * $i ) > $i ).
tff(v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2,type,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2: $i ).
tff(c_Natural_Oevaln,type,
c_Natural_Oevaln: ( $i * $i * $i * $i ) > $o ).
tff(f_141,axiom,
! [V_Z_H] : ( V_Z_H = v_s_H ),
file(unknown,unknown) ).
tff(f_139,axiom,
c_Hoare__Mirabelle_Ostate__not__singleton,
file(unknown,unknown) ).
tff(f_123,axiom,
( ( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 )
| ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
file(unknown,unknown) ).
tff(c_50,plain,
! [V_Z_H_71] : ( v_s_H = V_Z_H_71 ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_48,plain,
c_Hoare__Mirabelle_Ostate__not__singleton,
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_40,plain,
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 ) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_54,plain,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_40]) ).
tff(c_82,plain,
v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 != v_s_H,
inference(superposition,[status(thm),theory(equality)],[c_50,c_54]) ).
tff(c_100,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_50,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV866-1 : TPTP v8.1.2. Released v4.1.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.15/0.36 % Computer : n018.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 23:19:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.86/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.66
% 2.86/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.09/1.68
% 3.09/1.68 Inference rules
% 3.09/1.68 ----------------------
% 3.09/1.68 #Ref : 0
% 3.09/1.68 #Sup : 15
% 3.09/1.68 #Fact : 0
% 3.09/1.68 #Define : 0
% 3.09/1.68 #Split : 0
% 3.09/1.68 #Chain : 0
% 3.09/1.68 #Close : 0
% 3.09/1.68
% 3.09/1.68 Ordering : KBO
% 3.09/1.68
% 3.09/1.68 Simplification rules
% 3.09/1.68 ----------------------
% 3.09/1.68 #Subsume : 3
% 3.09/1.68 #Demod : 4
% 3.09/1.68 #Tautology : 1
% 3.09/1.68 #SimpNegUnit : 0
% 3.09/1.68 #BackRed : 0
% 3.09/1.68
% 3.09/1.68 #Partial instantiations: 24
% 3.09/1.68 #Strategies tried : 1
% 3.09/1.68
% 3.09/1.68 Timing (in seconds)
% 3.09/1.68 ----------------------
% 3.09/1.68 Preprocessing : 0.47
% 3.09/1.68 Parsing : 0.26
% 3.09/1.68 CNF conversion : 0.03
% 3.09/1.68 Main loop : 0.17
% 3.09/1.68 Inferencing : 0.05
% 3.09/1.68 Reduction : 0.05
% 3.09/1.68 Demodulation : 0.04
% 3.09/1.68 BG Simplification : 0.02
% 3.09/1.68 Subsumption : 0.04
% 3.09/1.68 Abstraction : 0.01
% 3.09/1.68 MUC search : 0.00
% 3.09/1.68 Cooper : 0.00
% 3.09/1.68 Total : 0.68
% 3.09/1.68 Index Insertion : 0.00
% 3.09/1.68 Index Deletion : 0.00
% 3.09/1.68 Index Matching : 0.00
% 3.09/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------