TSTP Solution File: TOP051-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : TOP051-1 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %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 : 600s
% DateTime : Thu Jul 21 21:31:50 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 71 ( 58 unt; 13 typ; 0 def)
% Number of atoms : 142 ( 92 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 254 ( 6 ~; 0 |; 0 &; 248 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 13 con; 0-10 aty)
% Number of variables : 32 ( 0 ^ 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a1,type,
a1: $i ).
thf(tp_a10,type,
a10: $i ).
thf(tp_a11,type,
a11: $i ).
thf(tp_a2,type,
a2: $i ).
thf(tp_a3,type,
a3: $i ).
thf(tp_a4,type,
a4: $i ).
thf(tp_a5,type,
a5: $i ).
thf(tp_a6,type,
a6: $i ).
thf(tp_a7,type,
a7: $i ).
thf(tp_a8,type,
a8: $i ).
thf(tp_a9,type,
a9: $i ).
thf(tp_product,type,
product: $i > $i > $i ).
thf(tp_tuple,type,
tuple: $i > $i > $i > $i > $i > $i > $i > $i > $i > $i > $i ).
thf(1,axiom,
( ( product @ a10 @ a5 )
= a11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_11) ).
thf(2,axiom,
( ( product @ a9 @ a4 )
= a10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_10) ).
thf(3,axiom,
( ( product @ a8 @ a6 )
= a9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_09) ).
thf(4,axiom,
( ( product @ a7 @ a3 )
= a8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_08) ).
thf(5,axiom,
( ( product @ a6 @ a2 )
= a7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_07) ).
thf(6,axiom,
( ( product @ a5 @ a9 )
= a6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_06) ).
thf(7,axiom,
( ( product @ a4 @ a10 )
= a5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_05) ).
thf(8,axiom,
( ( product @ a3 @ a1 )
= a4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_04) ).
thf(9,axiom,
( ( product @ a2 @ a7 )
= a3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_03) ).
thf(10,axiom,
( ( product @ a1 @ a6 )
= a2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot) ).
thf(11,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( product @ ( product @ X @ Y ) @ Z )
= ( product @ ( product @ X @ Z ) @ ( product @ Y @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle_02) ).
thf(12,axiom,
! [X: $i,Y: $i] :
( ( product @ ( product @ X @ Y ) @ Y )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle_01) ).
thf(13,axiom,
! [X: $i] :
( ( product @ X @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle) ).
thf(14,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(15,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[14]) ).
thf(16,negated_conjecture,
( tuple @ a1 @ a6 @ a5 @ a2 @ a7 @ a3 @ a4 @ a9 @ a10 @ a8 )
!= ( tuple @ a2 @ a7 @ a6 @ a3 @ a8 @ a4 @ a5 @ a10 @ a11 @ a9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
thf(17,plain,
$false = $false,
inference(unfold_def,[status(thm)],[15]) ).
thf(18,plain,
( ( ( product @ a10 @ a5 )
= a11 )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(19,plain,
( ( ( product @ a9 @ a4 )
= a10 )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(20,plain,
( ( ( product @ a8 @ a6 )
= a9 )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(21,plain,
( ( ( product @ a7 @ a3 )
= a8 )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(22,plain,
( ( ( product @ a6 @ a2 )
= a7 )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(23,plain,
( ( ( product @ a5 @ a9 )
= a6 )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(24,plain,
( ( ( product @ a4 @ a10 )
= a5 )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(25,plain,
( ( ( product @ a3 @ a1 )
= a4 )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(26,plain,
( ( ( product @ a2 @ a7 )
= a3 )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(27,plain,
( ( ( product @ a1 @ a6 )
= a2 )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(28,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( product @ ( product @ X @ Y ) @ Z )
= ( product @ ( product @ X @ Z ) @ ( product @ Y @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(29,plain,
( ( ! [X: $i,Y: $i] :
( ( product @ ( product @ X @ Y ) @ Y )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(30,plain,
( ( ! [X: $i] :
( ( product @ X @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(31,plain,
( ( ( ( tuple @ a1 @ a6 @ a5 @ a2 @ a7 @ a3 @ a4 @ a9 @ a10 @ a8 )
!= ( tuple @ a2 @ a7 @ a6 @ a3 @ a8 @ a4 @ a5 @ a10 @ a11 @ a9 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(32,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[17]) ).
thf(33,plain,
( ( ( ( tuple @ a1 @ a6 @ a5 @ a2 @ a7 @ a3 @ a4 @ a9 @ a10 @ a8 )
!= ( tuple @ a2 @ a7 @ a6 @ a3 @ a8 @ a4 @ a5 @ a10 @ a11 @ a9 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[31]) ).
thf(34,plain,
( ( ( ( tuple @ a1 @ a6 @ a5 @ a2 @ a7 @ a3 @ a4 @ a9 @ a10 @ a8 )
!= ( tuple @ a2 @ a7 @ a6 @ a3 @ a8 @ a4 @ a5 @ a10 @ a11 @ a9 ) ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(35,plain,
( ( ! [X: $i] :
( ( product @ X @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(36,plain,
( ( ! [X: $i,Y: $i] :
( ( product @ ( product @ X @ Y ) @ Y )
= X ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(37,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( product @ ( product @ X @ Y ) @ Z )
= ( product @ ( product @ X @ Z ) @ ( product @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(38,plain,
( ( ( product @ a1 @ a6 )
= a2 )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(39,plain,
( ( ( product @ a2 @ a7 )
= a3 )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(40,plain,
( ( ( product @ a3 @ a1 )
= a4 )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(41,plain,
( ( ( product @ a4 @ a10 )
= a5 )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(42,plain,
( ( ( product @ a5 @ a9 )
= a6 )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(43,plain,
( ( ( product @ a6 @ a2 )
= a7 )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(44,plain,
( ( ( product @ a7 @ a3 )
= a8 )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(45,plain,
( ( ( product @ a8 @ a6 )
= a9 )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(46,plain,
( ( ( product @ a9 @ a4 )
= a10 )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(47,plain,
( ( ( product @ a10 @ a5 )
= a11 )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(48,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(49,plain,
( ( ( tuple @ a1 @ a6 @ a5 @ a2 @ a7 @ a3 @ a4 @ a9 @ a10 @ a8 )
= ( tuple @ a2 @ a7 @ a6 @ a3 @ a8 @ a4 @ a5 @ a10 @ a11 @ a9 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(50,plain,
! [SV1: $i] :
( ( ( product @ SV1 @ SV1 )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(51,plain,
! [SV2: $i] :
( ( ! [SY6: $i] :
( ( product @ ( product @ SV2 @ SY6 ) @ SY6 )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(52,plain,
! [SV3: $i] :
( ( ! [SY7: $i,SY8: $i] :
( ( product @ ( product @ SV3 @ SY7 ) @ SY8 )
= ( product @ ( product @ SV3 @ SY8 ) @ ( product @ SY7 @ SY8 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(53,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(54,plain,
! [SV4: $i,SV2: $i] :
( ( ( product @ ( product @ SV2 @ SV4 ) @ SV4 )
= SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(55,plain,
! [SV5: $i,SV3: $i] :
( ( ! [SY9: $i] :
( ( product @ ( product @ SV3 @ SV5 ) @ SY9 )
= ( product @ ( product @ SV3 @ SY9 ) @ ( product @ SV5 @ SY9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(56,plain,
! [SV6: $i,SV5: $i,SV3: $i] :
( ( ( product @ ( product @ SV3 @ SV5 ) @ SV6 )
= ( product @ ( product @ SV3 @ SV6 ) @ ( product @ SV5 @ SV6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[55]) ).
thf(57,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[38,56,54,53,50,49,47,46,45,44,43,42,41,40,39]) ).
thf(58,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : TOP051-1 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n029.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 : Sun May 29 14:29:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 14
% 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:14,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:16,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.19/0.53
% 0.19/0.53 ********************************
% 0.19/0.53 * All subproblems solved! *
% 0.19/0.53 ********************************
% 0.19/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:14,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:57,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.53
% 0.19/0.53 %**** Beginning of derivation protocol ****
% 0.19/0.53 % SZS output start CNFRefutation
% See solution above
% 0.19/0.53
% 0.19/0.53 %**** End of derivation protocol ****
% 0.19/0.53 %**** no. of clauses in derivation: 58 ****
% 0.19/0.53 %**** clause counter: 57 ****
% 0.19/0.53
% 0.19/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:14,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:57,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------