TSTP Solution File: COL103-2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : COL103-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n026.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 : 600s
% DateTime : Fri Jul 15 00:34:51 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 18 unt; 9 typ; 0 def)
% Number of atoms : 46 ( 14 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 131 ( 5 ~; 0 |; 0 &; 126 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-4 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_c_Comb_Ocomb_Oop_A_D_D,type,
c_Comb_Ocomb_Oop_A_D_D: $i > $i > $i ).
thf(tp_c_Comb_Ocontract,type,
c_Comb_Ocontract: $i ).
thf(tp_c_Pair,type,
c_Pair: $i > $i > $i > $i > $i ).
thf(tp_c_Transitive__Closure_Ortrancl,type,
c_Transitive__Closure_Ortrancl: $i > $i > $i ).
thf(tp_c_in,type,
c_in: $i > $i > $i > $o ).
thf(tp_tc_Comb_Ocomb,type,
tc_Comb_Ocomb: $i ).
thf(tp_tc_prod,type,
tc_prod: $i > $i > $i ).
thf(tp_v_x,type,
v_x: $i ).
thf(tp_v_z,type,
v_z: $i ).
thf(1,axiom,
! [V_a: $i,T_a: $i,V_r: $i] : ( 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('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0) ).
thf(2,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(3,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,negated_conjecture,
~ ( 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('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
thf(5,plain,
$false = $false,
inference(unfold_def,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [V_a: $i,T_a: $i,V_r: $i] : ( 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 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,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 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(8,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,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 ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [V_a: $i,T_a: $i,V_r: $i] : ( 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 ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(11,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,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 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(13,plain,
! [SV1: $i] :
( ( ! [SY3: $i,SY4: $i] : ( c_in @ ( c_Pair @ SV1 @ SV1 @ SY3 @ SY3 ) @ ( c_Transitive__Closure_Ortrancl @ SY4 @ SY3 ) @ ( tc_prod @ SY3 @ SY3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(14,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(15,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY5: $i] : ( c_in @ ( c_Pair @ SV1 @ SV1 @ SV2 @ SV2 ) @ ( c_Transitive__Closure_Ortrancl @ SY5 @ SV2 ) @ ( tc_prod @ SV2 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(16,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( c_in @ ( c_Pair @ SV1 @ SV1 @ SV2 @ SV2 ) @ ( c_Transitive__Closure_Ortrancl @ SV3 @ SV2 ) @ ( tc_prod @ SV2 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(17,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,16,14]) ).
thf(18,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : COL103-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 08:34:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 2
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:17,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 18 ****
% 0.12/0.37 %**** clause counter: 17 ****
% 0.12/0.37
% 0.12/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:17,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------