TSTP Solution File: LAT261-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT261-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 : n027.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:33 EDT 2023
% Result : Unsatisfiable 2.09s 1.41s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of formulae : 12 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > tc_Tarski_Opotype_Opotype__ext__type > c_Tarski_Odual > #nlpp > v_cl > tc_Product__Type_Ounit > t_a > c_Tarski_OCompleteLattice
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Tarski_Odual,type,
c_Tarski_Odual: ( $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_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(tc_Tarski_Opotype_Opotype__ext__type,type,
tc_Tarski_Opotype_Opotype__ext__type: ( $i * $i ) > $i ).
tff(c_Tarski_OCompleteLattice,type,
c_Tarski_OCompleteLattice: $i ).
tff(f_28,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file(unknown,unknown) ).
tff(f_27,axiom,
~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file(unknown,unknown) ).
tff(c_4,plain,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_6,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT261-2 : TPTP v8.1.2. Released v3.2.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.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 12:48:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.09/1.41 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.09/1.41
% 2.09/1.41 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.09/1.45
% 2.09/1.45 Inference rules
% 2.09/1.45 ----------------------
% 2.09/1.45 #Ref : 0
% 2.09/1.45 #Sup : 0
% 2.09/1.45 #Fact : 0
% 2.09/1.45 #Define : 0
% 2.09/1.45 #Split : 0
% 2.09/1.45 #Chain : 0
% 2.09/1.45 #Close : 0
% 2.09/1.45
% 2.09/1.45 Ordering : KBO
% 2.09/1.45
% 2.09/1.45 Simplification rules
% 2.09/1.45 ----------------------
% 2.09/1.45 #Subsume : 1
% 2.09/1.45 #Demod : 1
% 2.09/1.45 #Tautology : 0
% 2.09/1.45 #SimpNegUnit : 0
% 2.09/1.45 #BackRed : 0
% 2.09/1.45
% 2.09/1.45 #Partial instantiations: 0
% 2.09/1.45 #Strategies tried : 1
% 2.09/1.45
% 2.09/1.45 Timing (in seconds)
% 2.09/1.45 ----------------------
% 2.09/1.45 Preprocessing : 0.35
% 2.09/1.45 Parsing : 0.19
% 2.09/1.45 CNF conversion : 0.01
% 2.09/1.45 Main loop : 0.05
% 2.09/1.45 Inferencing : 0.00
% 2.09/1.45 Reduction : 0.02
% 2.09/1.45 Demodulation : 0.02
% 2.09/1.45 BG Simplification : 0.01
% 2.09/1.45 Subsumption : 0.02
% 2.09/1.45 Abstraction : 0.00
% 2.09/1.45 MUC search : 0.00
% 2.09/1.45 Cooper : 0.00
% 2.09/1.45 Total : 0.46
% 2.09/1.45 Index Insertion : 0.00
% 2.09/1.45 Index Deletion : 0.00
% 2.09/1.45 Index Matching : 0.00
% 2.09/1.45 BG Taut test : 0.00
%------------------------------------------------------------------------------