TSTP Solution File: COL103-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL103-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:35:06 EDT 2023
% Result : Unsatisfiable 1.84s 1.31s
% Output : CNFRefutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 5 unt; 9 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 : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_Pair > tc_prod > c_Transitive__Closure_Ortrancl > c_Comb_Ocomb_Oop_A_D_D > #nlpp > v_z > v_x > tc_Comb_Ocomb > c_Comb_Ocontract
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(c_Transitive__Closure_Ortrancl,type,
c_Transitive__Closure_Ortrancl: ( $i * $i ) > $i ).
tff(c_Comb_Ocontract,type,
c_Comb_Ocontract: $i ).
tff(v_z,type,
v_z: $i ).
tff(tc_prod,type,
tc_prod: ( $i * $i ) > $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(c_Pair,type,
c_Pair: ( $i * $i * $i * $i ) > $i ).
tff(c_Comb_Ocomb_Oop_A_D_D,type,
c_Comb_Ocomb_Oop_A_D_D: ( $i * $i ) > $i ).
tff(tc_Comb_Ocomb,type,
tc_Comb_Ocomb: $i ).
tff(f_29,axiom,
! [V_a,T_a,V_r] : c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)),
file(unknown,unknown) ).
tff(f_27,axiom,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_a_1,T_a_2,V_r_3] : c_in(c_Pair(V_a_1,V_a_1,T_a_2,T_a_2),c_Transitive__Closure_Ortrancl(V_r_3,T_a_2),tc_prod(T_a_2,T_a_2)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
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.10 % Problem : COL103-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11 % 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.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu Aug 3 18:14:21 EDT 2023
% 0.10/0.30 % CPUTime :
% 1.84/1.31 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.84/1.31
% 1.84/1.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.84/1.35
% 1.84/1.35 Inference rules
% 1.84/1.35 ----------------------
% 1.84/1.35 #Ref : 0
% 1.84/1.35 #Sup : 0
% 1.84/1.35 #Fact : 0
% 1.84/1.35 #Define : 0
% 1.84/1.35 #Split : 0
% 1.84/1.35 #Chain : 0
% 1.84/1.35 #Close : 0
% 1.84/1.35
% 1.84/1.35 Ordering : KBO
% 1.84/1.35
% 1.84/1.35 Simplification rules
% 1.84/1.35 ----------------------
% 1.84/1.35 #Subsume : 1
% 1.84/1.35 #Demod : 1
% 1.84/1.35 #Tautology : 0
% 1.84/1.35 #SimpNegUnit : 0
% 1.84/1.35 #BackRed : 0
% 1.84/1.35
% 1.84/1.35 #Partial instantiations: 0
% 1.84/1.35 #Strategies tried : 1
% 1.84/1.35
% 1.84/1.35 Timing (in seconds)
% 1.84/1.35 ----------------------
% 1.84/1.36 Preprocessing : 0.37
% 1.84/1.36 Parsing : 0.21
% 1.84/1.36 CNF conversion : 0.02
% 1.84/1.36 Main loop : 0.04
% 1.84/1.36 Inferencing : 0.00
% 1.84/1.36 Reduction : 0.02
% 1.84/1.36 Demodulation : 0.02
% 1.84/1.36 BG Simplification : 0.01
% 1.84/1.36 Subsumption : 0.02
% 1.84/1.36 Abstraction : 0.00
% 1.84/1.36 MUC search : 0.00
% 1.84/1.36 Cooper : 0.00
% 1.84/1.36 Total : 0.48
% 1.84/1.36 Index Insertion : 0.00
% 1.84/1.36 Index Deletion : 0.00
% 1.84/1.36 Index Matching : 0.00
% 1.84/1.36 BG Taut test : 0.00
%------------------------------------------------------------------------------