TSTP Solution File: LAT270-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT270-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/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 : 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:46:35 EDT 2023
% Result : Unsatisfiable 2.46s 1.55s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 23 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 4 >; 7 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Tarski_Ointerval > #nlpp > tc_set > v_r > v_b > v_a > v_S > v_A > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
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(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(v_A,type,
v_A: $i ).
tff(c_Tarski_Ointerval,type,
c_Tarski_Ointerval: ( $i * $i * $i * $i ) > $i ).
tff(f_30,axiom,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file(unknown,unknown) ).
tff(f_27,axiom,
c_in(v_b,v_A,t_a),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(v_a,v_A,t_a),
file(unknown,unknown) ).
tff(f_28,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_41,axiom,
! [V_b,V_a,V_S] :
( ~ c_in(V_b,v_A,t_a)
| ~ c_in(V_a,v_A,t_a)
| ~ c_lessequals(V_S,c_Tarski_Ointerval(v_r,V_a,V_b,t_a),tc_set(t_a))
| c_lessequals(V_S,v_A,tc_set(t_a)) ),
file(unknown,unknown) ).
tff(c_8,plain,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4,plain,
c_in(v_b,v_A,t_a),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
c_in(v_a,v_A,t_a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_6,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_28]) ).
tff(c_11,plain,
! [V_S_4,V_a_5,V_b_6] :
( c_lessequals(V_S_4,v_A,tc_set(t_a))
| ~ c_lessequals(V_S_4,c_Tarski_Ointerval(v_r,V_a_5,V_b_6,t_a),tc_set(t_a))
| ~ c_in(V_a_5,v_A,t_a)
| ~ c_in(V_b_6,v_A,t_a) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_14,plain,
( c_lessequals(v_S,v_A,tc_set(t_a))
| ~ c_in(v_a,v_A,t_a)
| ~ c_in(v_b,v_A,t_a) ),
inference(resolution,[status(thm)],[c_6,c_11]) ).
tff(c_17,plain,
c_lessequals(v_S,v_A,tc_set(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2,c_14]) ).
tff(c_19,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT270-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:35:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.46/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/1.56
% 2.46/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.46/1.60
% 2.46/1.60 Inference rules
% 2.46/1.60 ----------------------
% 2.46/1.60 #Ref : 0
% 2.46/1.60 #Sup : 1
% 2.46/1.60 #Fact : 0
% 2.46/1.60 #Define : 0
% 2.46/1.60 #Split : 0
% 2.46/1.60 #Chain : 0
% 2.46/1.60 #Close : 0
% 2.46/1.60
% 2.46/1.60 Ordering : KBO
% 2.46/1.60
% 2.46/1.60 Simplification rules
% 2.46/1.60 ----------------------
% 2.46/1.60 #Subsume : 0
% 2.46/1.60 #Demod : 2
% 2.46/1.60 #Tautology : 0
% 2.46/1.60 #SimpNegUnit : 1
% 2.46/1.60 #BackRed : 0
% 2.46/1.60
% 2.46/1.60 #Partial instantiations: 0
% 2.46/1.60 #Strategies tried : 1
% 2.46/1.60
% 2.46/1.60 Timing (in seconds)
% 2.46/1.60 ----------------------
% 2.46/1.60 Preprocessing : 0.40
% 2.46/1.60 Parsing : 0.22
% 2.46/1.60 CNF conversion : 0.02
% 2.46/1.60 Main loop : 0.13
% 2.46/1.60 Inferencing : 0.06
% 2.57/1.60 Reduction : 0.03
% 2.57/1.60 Demodulation : 0.02
% 2.57/1.60 BG Simplification : 0.01
% 2.57/1.60 Subsumption : 0.02
% 2.57/1.60 Abstraction : 0.00
% 2.57/1.60 MUC search : 0.00
% 2.57/1.60 Cooper : 0.00
% 2.57/1.60 Total : 0.58
% 2.57/1.60 Index Insertion : 0.00
% 2.57/1.60 Index Deletion : 0.00
% 2.57/1.60 Index Matching : 0.00
% 2.57/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------