TSTP Solution File: LAT271-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT271-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 : 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 10:46:35 EDT 2023
% Result : Unsatisfiable 2.03s 1.48s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of formulae : 23 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 6 >; 11 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Tarski_Ointerval > c_Pair > tc_prod > #nlpp > tc_set > v_x > v_r > v_b > v_a > 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(tc_set,type,
tc_set: $i > $i ).
tff(t_a,type,
t_a: $i ).
tff(v_b,type,
v_b: $i ).
tff(tc_prod,type,
tc_prod: ( $i * $i ) > $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(v_a,type,
v_a: $i ).
tff(v_r,type,
v_r: $i ).
tff(c_Pair,type,
c_Pair: ( $i * $i * $i * $i ) > $i ).
tff(c_Tarski_Ointerval,type,
c_Tarski_Ointerval: ( $i * $i * $i * $i ) > $i ).
tff(f_27,axiom,
c_in(v_x,v_S,t_a),
file(unknown,unknown) ).
tff(f_26,axiom,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V_r,V_a,T_a,V_S,V_b,V_x] :
( ~ c_in(V_x,V_S,T_a)
| ~ c_lessequals(V_S,c_Tarski_Ointerval(V_r,V_a,V_b,T_a),tc_set(T_a))
| c_in(c_Pair(V_a,V_x,T_a,T_a),V_r,tc_prod(T_a,T_a)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file(unknown,unknown) ).
tff(c_4,plain,
c_in(v_x,v_S,t_a),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_9,plain,
! [V_x_12,V_S_9,V_a_11,V_b_8,V_r_7,T_a_10] :
( c_in(c_Pair(V_a_11,V_x_12,T_a_10,T_a_10),V_r_7,tc_prod(T_a_10,T_a_10))
| ~ c_lessequals(V_S_9,c_Tarski_Ointerval(V_r_7,V_a_11,V_b_8,T_a_10),tc_set(T_a_10))
| ~ c_in(V_x_12,V_S_9,T_a_10) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_13,plain,
! [V_x_13] :
( c_in(c_Pair(v_a,V_x_13,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_x_13,v_S,t_a) ),
inference(resolution,[status(thm)],[c_2,c_9]) ).
tff(c_6,plain,
~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_16,plain,
~ c_in(v_x,v_S,t_a),
inference(resolution,[status(thm)],[c_13,c_6]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT271-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % 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.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Thu Aug 3 12:41:21 EDT 2023
% 0.12/0.31 % CPUTime :
% 2.03/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.03/1.49
% 2.03/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.03/1.52
% 2.03/1.52 Inference rules
% 2.03/1.52 ----------------------
% 2.03/1.52 #Ref : 0
% 2.03/1.52 #Sup : 2
% 2.03/1.52 #Fact : 0
% 2.03/1.52 #Define : 0
% 2.03/1.52 #Split : 0
% 2.03/1.52 #Chain : 0
% 2.03/1.52 #Close : 0
% 2.03/1.52
% 2.03/1.52 Ordering : KBO
% 2.03/1.52
% 2.03/1.52 Simplification rules
% 2.03/1.52 ----------------------
% 2.03/1.52 #Subsume : 0
% 2.03/1.52 #Demod : 1
% 2.03/1.52 #Tautology : 0
% 2.03/1.52 #SimpNegUnit : 0
% 2.03/1.52 #BackRed : 0
% 2.03/1.52
% 2.03/1.52 #Partial instantiations: 0
% 2.03/1.52 #Strategies tried : 1
% 2.03/1.52
% 2.03/1.52 Timing (in seconds)
% 2.03/1.52 ----------------------
% 2.03/1.53 Preprocessing : 0.39
% 2.03/1.53 Parsing : 0.22
% 2.03/1.53 CNF conversion : 0.02
% 2.03/1.53 Main loop : 0.13
% 2.03/1.53 Inferencing : 0.06
% 2.03/1.53 Reduction : 0.03
% 2.03/1.53 Demodulation : 0.02
% 2.03/1.53 BG Simplification : 0.01
% 2.03/1.53 Subsumption : 0.02
% 2.03/1.53 Abstraction : 0.00
% 2.03/1.53 MUC search : 0.00
% 2.03/1.53 Cooper : 0.00
% 2.03/1.53 Total : 0.57
% 2.03/1.53 Index Insertion : 0.00
% 2.03/1.53 Index Deletion : 0.00
% 2.03/1.53 Index Matching : 0.00
% 2.03/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------