TSTP Solution File: LAT275-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT275-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 : n029.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:36 EDT 2023
% Result : Unsatisfiable 2.23s 1.66s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 21 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 13 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 2 (; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Tarski_Opotype_Opset > c_Tarski_Olub > #nlpp > tc_set > v_cl > v_S > v_A > tc_Product__Type_Ounit > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_S,type,
v_S: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_Tarski_Opotype_Opset,type,
c_Tarski_Opotype_Opset: ( $i * $i * $i ) > $i ).
tff(t_a,type,
t_a: $i ).
tff(v_cl,type,
v_cl: $i ).
tff(tc_Product__Type_Ounit,type,
tc_Product__Type_Ounit: $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(c_Tarski_Olub,type,
c_Tarski_Olub: ( $i * $i * $i ) > $i ).
tff(v_A,type,
v_A: $i ).
tff(f_29,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file(unknown,unknown) ).
tff(f_28,axiom,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
file(unknown,unknown) ).
tff(f_26,axiom,
c_lessequals(v_S,v_A,tc_set(t_a)),
file(unknown,unknown) ).
tff(f_34,axiom,
! [V_S] :
( ~ c_lessequals(V_S,v_A,tc_set(t_a))
| c_in(c_Tarski_Olub(V_S,v_cl,t_a),v_A,t_a) ),
file(unknown,unknown) ).
tff(c_6,plain,
c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_4,plain,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_9,plain,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),v_A,t_a),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_2,plain,
c_lessequals(v_S,v_A,tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_14,plain,
! [V_S_2] :
( c_in(c_Tarski_Olub(V_S_2,v_cl,t_a),v_A,t_a)
| ~ c_lessequals(V_S_2,v_A,tc_set(t_a)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_17,plain,
c_in(c_Tarski_Olub(v_S,v_cl,t_a),v_A,t_a),
inference(resolution,[status(thm)],[c_2,c_14]) ).
tff(c_21,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LAT275-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15 % 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.37 % Computer : n029.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 13:03:52 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.23/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.23/1.67
% 2.23/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.23/1.69
% 2.23/1.69 Inference rules
% 2.23/1.69 ----------------------
% 2.23/1.69 #Ref : 0
% 2.23/1.69 #Sup : 3
% 2.23/1.69 #Fact : 0
% 2.23/1.69 #Define : 0
% 2.23/1.69 #Split : 0
% 2.23/1.69 #Chain : 0
% 2.23/1.69 #Close : 0
% 2.23/1.69
% 2.23/1.69 Ordering : KBO
% 2.23/1.69
% 2.23/1.69 Simplification rules
% 2.23/1.69 ----------------------
% 2.23/1.69 #Subsume : 0
% 2.23/1.69 #Demod : 1
% 2.23/1.69 #Tautology : 2
% 2.23/1.69 #SimpNegUnit : 1
% 2.23/1.69 #BackRed : 0
% 2.23/1.69
% 2.23/1.69 #Partial instantiations: 0
% 2.23/1.69 #Strategies tried : 1
% 2.23/1.69
% 2.23/1.69 Timing (in seconds)
% 2.23/1.69 ----------------------
% 2.23/1.69 Preprocessing : 0.49
% 2.23/1.69 Parsing : 0.30
% 2.23/1.69 CNF conversion : 0.02
% 2.23/1.69 Main loop : 0.13
% 2.23/1.69 Inferencing : 0.07
% 2.23/1.69 Reduction : 0.03
% 2.23/1.69 Demodulation : 0.02
% 2.23/1.70 BG Simplification : 0.01
% 2.23/1.70 Subsumption : 0.02
% 2.23/1.70 Abstraction : 0.00
% 2.23/1.70 MUC search : 0.00
% 2.23/1.70 Cooper : 0.00
% 2.23/1.70 Total : 0.67
% 2.23/1.70 Index Insertion : 0.00
% 2.23/1.70 Index Deletion : 0.00
% 2.23/1.70 Index Matching : 0.00
% 2.23/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------