TSTP Solution File: SWV985-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV985-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/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 : n014.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:06:04 EDT 2023
% Result : Unsatisfiable 2.11s 1.45s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 13
% Syntax : Number of formulae : 16 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 5 >; 9 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-5 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_WellTypeRT_OWTrt > c_fequal > c_TypeSafe__Mirabelle_Osconf > c_COMBI > #nlpp > c_State_Ohp > v_s_H > v_e_H > v_T____ > v_P > v_E > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_P,type,
v_P: $i ).
tff(v_E,type,
v_E: $i ).
tff(t_a,type,
t_a: $i ).
tff(v_s_H,type,
v_s_H: $i ).
tff(c_COMBI,type,
c_COMBI: ( $i * $i ) > $i ).
tff(c_fequal,type,
c_fequal: ( $i * $i * $i ) > $o ).
tff(c_State_Ohp,type,
c_State_Ohp: $i > $i ).
tff(c_WellTypeRT_OWTrt,type,
c_WellTypeRT_OWTrt: ( $i * $i * $i * $i * $i ) > $o ).
tff(v_T____,type,
v_T____: $i ).
tff(c_TypeSafe__Mirabelle_Osconf,type,
c_TypeSafe__Mirabelle_Osconf: ( $i * $i * $i ) > $o ).
tff(v_e_H,type,
v_e_H: $i ).
tff(f_30,axiom,
~ c_TypeSafe__Mirabelle_Osconf(v_P,v_E,v_s_H),
file(unknown,unknown) ).
tff(f_26,axiom,
c_TypeSafe__Mirabelle_Osconf(v_P,v_E,v_s_H),
file(unknown,unknown) ).
tff(c_10,plain,
~ c_TypeSafe__Mirabelle_Osconf(v_P,v_E,v_s_H),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4,plain,
c_TypeSafe__Mirabelle_Osconf(v_P,v_E,v_s_H),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_15,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV985-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % 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.34 % Computer : n014.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 22:26:33 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.11/1.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.46
% 2.11/1.46 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.33/1.49
% 2.33/1.49 Inference rules
% 2.33/1.49 ----------------------
% 2.33/1.49 #Ref : 0
% 2.33/1.49 #Sup : 0
% 2.33/1.49 #Fact : 0
% 2.33/1.49 #Define : 0
% 2.33/1.49 #Split : 0
% 2.33/1.49 #Chain : 0
% 2.33/1.49 #Close : 0
% 2.33/1.49
% 2.33/1.49 Ordering : KBO
% 2.33/1.49
% 2.33/1.49 Simplification rules
% 2.33/1.49 ----------------------
% 2.33/1.49 #Subsume : 6
% 2.33/1.49 #Demod : 0
% 2.33/1.49 #Tautology : 0
% 2.33/1.49 #SimpNegUnit : 1
% 2.33/1.49 #BackRed : 0
% 2.33/1.49
% 2.33/1.49 #Partial instantiations: 0
% 2.33/1.49 #Strategies tried : 1
% 2.33/1.49
% 2.33/1.49 Timing (in seconds)
% 2.33/1.49 ----------------------
% 2.33/1.49 Preprocessing : 0.39
% 2.33/1.50 Parsing : 0.21
% 2.33/1.50 CNF conversion : 0.02
% 2.33/1.50 Main loop : 0.06
% 2.33/1.50 Inferencing : 0.00
% 2.33/1.50 Reduction : 0.02
% 2.33/1.50 Demodulation : 0.02
% 2.33/1.50 BG Simplification : 0.01
% 2.33/1.50 Subsumption : 0.03
% 2.33/1.50 Abstraction : 0.00
% 2.33/1.50 MUC search : 0.00
% 2.33/1.50 Cooper : 0.00
% 2.33/1.50 Total : 0.50
% 2.33/1.50 Index Insertion : 0.00
% 2.33/1.50 Index Deletion : 0.00
% 2.33/1.50 Index Matching : 0.00
% 2.33/1.50 BG Taut test : 0.00
%------------------------------------------------------------------------------