TSTP Solution File: PUZ063-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ063-2 : TPTP v8.1.2. Released v3.2.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 : n023.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 10:54:10 EDT 2023
% Result : Unsatisfiable 2.22s 1.57s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 16 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_union > c_Mutil_Otiling > #nlpp > tc_set > v_u > v_A > t_a > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_emptyset,type,
c_emptyset: $i ).
tff(t_a,type,
t_a: $i ).
tff(v_u,type,
v_u: $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(c_Mutil_Otiling,type,
c_Mutil_Otiling: ( $i * $i ) > $i ).
tff(c_union,type,
c_union: ( $i * $i * $i ) > $i ).
tff(v_A,type,
v_A: $i ).
tff(f_30,axiom,
! [V_y,T_a] : ( c_union(c_emptyset,V_y,T_a) = V_y ),
file(unknown,unknown) ).
tff(f_28,axiom,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_y_1,T_a_2] : ( c_union(c_emptyset,V_y_1,T_a_2) = V_y_1 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4,plain,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_7,plain,
~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_2,plain,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_8,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_7,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : PUZ063-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/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.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:52:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.22/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.22/1.57
% 2.22/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.43/1.61
% 2.43/1.61 Inference rules
% 2.43/1.61 ----------------------
% 2.43/1.61 #Ref : 0
% 2.43/1.61 #Sup : 0
% 2.43/1.61 #Fact : 0
% 2.43/1.61 #Define : 0
% 2.43/1.61 #Split : 0
% 2.43/1.61 #Chain : 0
% 2.43/1.61 #Close : 0
% 2.43/1.61
% 2.43/1.61 Ordering : KBO
% 2.43/1.61
% 2.43/1.61 Simplification rules
% 2.43/1.61 ----------------------
% 2.43/1.61 #Subsume : 2
% 2.43/1.61 #Demod : 1
% 2.43/1.61 #Tautology : 0
% 2.43/1.61 #SimpNegUnit : 1
% 2.43/1.61 #BackRed : 0
% 2.43/1.61
% 2.43/1.61 #Partial instantiations: 0
% 2.43/1.61 #Strategies tried : 1
% 2.43/1.61
% 2.43/1.61 Timing (in seconds)
% 2.43/1.61 ----------------------
% 2.43/1.61 Preprocessing : 0.38
% 2.43/1.61 Parsing : 0.21
% 2.43/1.61 CNF conversion : 0.02
% 2.43/1.61 Main loop : 0.05
% 2.43/1.61 Inferencing : 0.00
% 2.43/1.61 Reduction : 0.02
% 2.43/1.62 Demodulation : 0.02
% 2.43/1.62 BG Simplification : 0.01
% 2.43/1.62 Subsumption : 0.02
% 2.43/1.62 Abstraction : 0.00
% 2.43/1.62 MUC search : 0.00
% 2.43/1.62 Cooper : 0.00
% 2.43/1.62 Total : 0.48
% 2.43/1.62 Index Insertion : 0.00
% 2.43/1.62 Index Deletion : 0.00
% 2.43/1.62 Index Matching : 0.00
% 2.43/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------