TSTP Solution File: GRP568-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP568-1 : TPTP v8.1.0. Bugfixed v2.7.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 : Sat Jul 16 10:18:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 32 unt; 6 typ; 0 def)
% Number of atoms : 82 ( 49 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 164 ( 6 ~; 0 |; 0 &; 158 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 ^ 36 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_double_divide,type,
double_divide: $i > $i > $i ).
thf(tp_identity,type,
identity: $i ).
thf(tp_inverse,type,
inverse: $i > $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
! [A: $i] :
( identity
= ( double_divide @ A @ ( inverse @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
thf(2,axiom,
! [A: $i] :
( ( inverse @ A )
= ( double_divide @ A @ identity ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( multiply @ A @ B )
= ( double_divide @ ( double_divide @ B @ A ) @ identity ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( double_divide @ ( double_divide @ A @ ( double_divide @ ( double_divide @ B @ ( double_divide @ A @ C ) ) @ ( double_divide @ identity @ C ) ) ) @ ( double_divide @ identity @ identity ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
thf(5,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(6,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,negated_conjecture,
( multiply @ a @ b )
!= ( multiply @ b @ a ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
thf(8,plain,
$false = $false,
inference(unfold_def,[status(thm)],[6]) ).
thf(9,plain,
( ( ! [A: $i] :
( identity
= ( double_divide @ A @ ( inverse @ A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,plain,
( ( ! [A: $i] :
( ( inverse @ A )
= ( double_divide @ A @ identity ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(11,plain,
( ( ! [A: $i,B: $i] :
( ( multiply @ A @ B )
= ( double_divide @ ( double_divide @ B @ A ) @ identity ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( double_divide @ ( double_divide @ A @ ( double_divide @ ( double_divide @ B @ ( double_divide @ A @ C ) ) @ ( double_divide @ identity @ C ) ) ) @ ( double_divide @ identity @ identity ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(13,plain,
( ( ( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(14,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(15,plain,
( ( ( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(16,plain,
( ( ( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(17,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( double_divide @ ( double_divide @ A @ ( double_divide @ ( double_divide @ B @ ( double_divide @ A @ C ) ) @ ( double_divide @ identity @ C ) ) ) @ ( double_divide @ identity @ identity ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ( multiply @ A @ B )
= ( double_divide @ ( double_divide @ B @ A ) @ identity ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(19,plain,
( ( ! [A: $i] :
( ( inverse @ A )
= ( double_divide @ A @ identity ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(20,plain,
( ( ! [A: $i] :
( identity
= ( double_divide @ A @ ( inverse @ A ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(21,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(22,plain,
( ( ( multiply @ a @ b )
= ( multiply @ b @ a ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(23,plain,
! [SV1: $i] :
( ( ! [SY7: $i,SY8: $i] :
( ( double_divide @ ( double_divide @ SV1 @ ( double_divide @ ( double_divide @ SY7 @ ( double_divide @ SV1 @ SY8 ) ) @ ( double_divide @ identity @ SY8 ) ) ) @ ( double_divide @ identity @ identity ) )
= SY7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(24,plain,
! [SV2: $i] :
( ( ! [SY9: $i] :
( ( multiply @ SV2 @ SY9 )
= ( double_divide @ ( double_divide @ SY9 @ SV2 ) @ identity ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(25,plain,
! [SV3: $i] :
( ( ( inverse @ SV3 )
= ( double_divide @ SV3 @ identity ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(26,plain,
! [SV4: $i] :
( ( identity
= ( double_divide @ SV4 @ ( inverse @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(27,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(28,plain,
! [SV5: $i,SV1: $i] :
( ( ! [SY10: $i] :
( ( double_divide @ ( double_divide @ SV1 @ ( double_divide @ ( double_divide @ SV5 @ ( double_divide @ SV1 @ SY10 ) ) @ ( double_divide @ identity @ SY10 ) ) ) @ ( double_divide @ identity @ identity ) )
= SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(29,plain,
! [SV6: $i,SV2: $i] :
( ( ( multiply @ SV2 @ SV6 )
= ( double_divide @ ( double_divide @ SV6 @ SV2 ) @ identity ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(30,plain,
! [SV7: $i,SV5: $i,SV1: $i] :
( ( ( double_divide @ ( double_divide @ SV1 @ ( double_divide @ ( double_divide @ SV5 @ ( double_divide @ SV1 @ SV7 ) ) @ ( double_divide @ identity @ SV7 ) ) ) @ ( double_divide @ identity @ identity ) )
= SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(31,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[22,30,29,27,26,25]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP568-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 21:22:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36
% 0.20/0.36 No.of.Axioms: 5
% 0.20/0.36
% 0.20/0.36 Length.of.Defs: 0
% 0.20/0.36
% 0.20/0.36 Contains.Choice.Funs: false
% 0.20/0.36 (rf:0,axioms:5,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:7,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.20/0.47
% 0.20/0.47 ********************************
% 0.20/0.47 * All subproblems solved! *
% 0.20/0.47 ********************************
% 0.20/0.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,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:31,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.48
% 0.20/0.48 %**** Beginning of derivation protocol ****
% 0.20/0.48 % SZS output start CNFRefutation
% See solution above
% 0.20/0.48
% 0.20/0.48 %**** End of derivation protocol ****
% 0.20/0.48 %**** no. of clauses in derivation: 32 ****
% 0.20/0.48 %**** clause counter: 31 ****
% 0.20/0.48
% 0.20/0.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,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:31,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------