TSTP Solution File: SWV818-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV818-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 : n032.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:43 EDT 2023
% Result : Unsatisfiable 1.93s 1.50s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 13 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_Code__Evaluation_Otracing > #nlpp > v_x > v_ta > v_t > v_s > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(v_s,type,
v_s: $i ).
tff(t_a,type,
t_a: $i ).
tff(v_ta,type,
v_ta: $i ).
tff(c_Code__Evaluation_Otracing,type,
c_Code__Evaluation_Otracing: ( $i * $i * $i ) > $i ).
tff(v_t,type,
v_t: $i ).
tff(f_31,axiom,
! [V_s] : ( V_s = v_ta ),
file(unknown,unknown) ).
tff(f_29,axiom,
v_s != v_t,
file(unknown,unknown) ).
tff(c_23,plain,
v_ta = v_s,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [V_s_5] : ( v_ta = V_s_5 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_34,plain,
! [V_s_43] : ( v_s = V_s_43 ),
inference(superposition,[status(thm),theory(equality)],[c_23,c_10]) ).
tff(c_6,plain,
v_t != v_s,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_48,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_34,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV818-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/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.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 22:47:06 EDT 2023
% 0.13/0.33 % CPUTime :
% 1.93/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.93/1.50
% 1.93/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.04/1.52
% 2.04/1.52 Inference rules
% 2.04/1.52 ----------------------
% 2.04/1.52 #Ref : 0
% 2.04/1.52 #Sup : 13
% 2.04/1.52 #Fact : 0
% 2.04/1.52 #Define : 0
% 2.04/1.52 #Split : 0
% 2.04/1.52 #Chain : 0
% 2.04/1.52 #Close : 0
% 2.04/1.52
% 2.04/1.52 Ordering : KBO
% 2.04/1.52
% 2.04/1.52 Simplification rules
% 2.04/1.52 ----------------------
% 2.04/1.52 #Subsume : 2
% 2.04/1.52 #Demod : 1
% 2.04/1.52 #Tautology : 1
% 2.04/1.52 #SimpNegUnit : 0
% 2.04/1.52 #BackRed : 0
% 2.04/1.52
% 2.04/1.52 #Partial instantiations: 20
% 2.04/1.52 #Strategies tried : 1
% 2.04/1.52
% 2.04/1.52 Timing (in seconds)
% 2.04/1.52 ----------------------
% 2.04/1.52 Preprocessing : 0.38
% 2.04/1.52 Parsing : 0.19
% 2.04/1.52 CNF conversion : 0.02
% 2.04/1.52 Main loop : 0.13
% 2.04/1.52 Inferencing : 0.06
% 2.04/1.52 Reduction : 0.03
% 2.04/1.52 Demodulation : 0.02
% 2.04/1.53 BG Simplification : 0.01
% 2.04/1.53 Subsumption : 0.03
% 2.04/1.53 Abstraction : 0.01
% 2.04/1.53 MUC search : 0.00
% 2.04/1.53 Cooper : 0.00
% 2.04/1.53 Total : 0.55
% 2.04/1.53 Index Insertion : 0.00
% 2.04/1.53 Index Deletion : 0.00
% 2.04/1.53 Index Matching : 0.00
% 2.04/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------