TSTP Solution File: GRP446-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n012.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:03 EDT 2022
% Result : Unsatisfiable 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 30 unt; 5 typ; 0 def)
% Number of atoms : 78 ( 46 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 200 ( 6 ~; 0 |; 0 &; 194 @)
% ( 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 : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 46 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a2,type,
a2: $i ).
thf(tp_b2,type,
b2: $i ).
thf(tp_divide,type,
divide: $i > $i > $i ).
thf(tp_inverse,type,
inverse: $i > $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ( inverse @ A )
= ( divide @ ( divide @ B @ B ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
thf(2,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( divide @ ( divide @ C @ C ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ( divide @ A @ ( divide @ ( divide @ ( divide @ ( divide @ A @ A ) @ B ) @ C ) @ ( divide @ ( divide @ ( divide @ A @ A ) @ A ) @ C ) ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
thf(4,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(5,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,negated_conjecture,
( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
thf(7,plain,
$false = $false,
inference(unfold_def,[status(thm)],[5]) ).
thf(8,plain,
( ( ! [A: $i,B: $i] :
( ( inverse @ A )
= ( divide @ ( divide @ B @ B ) @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( divide @ ( divide @ C @ C ) @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( divide @ A @ ( divide @ ( divide @ ( divide @ ( divide @ A @ A ) @ B ) @ C ) @ ( divide @ ( divide @ ( divide @ A @ A ) @ A ) @ C ) ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(14,plain,
( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(15,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( divide @ A @ ( divide @ ( divide @ ( divide @ ( divide @ A @ A ) @ B ) @ C ) @ ( divide @ ( divide @ ( divide @ A @ A ) @ A ) @ C ) ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( divide @ ( divide @ C @ C ) @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [A: $i,B: $i] :
( ( inverse @ A )
= ( divide @ ( divide @ B @ B ) @ A ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(18,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(19,plain,
( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
= a2 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(20,plain,
! [SV1: $i] :
( ( ! [SY8: $i,SY9: $i] :
( ( divide @ SV1 @ ( divide @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SY8 ) @ SY9 ) @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SV1 ) @ SY9 ) ) )
= SY8 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(21,plain,
! [SV2: $i] :
( ( ! [SY10: $i,SY11: $i] :
( ( multiply @ SV2 @ SY10 )
= ( divide @ SV2 @ ( divide @ ( divide @ SY11 @ SY11 ) @ SY10 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(22,plain,
! [SV3: $i] :
( ( ! [SY12: $i] :
( ( inverse @ SV3 )
= ( divide @ ( divide @ SY12 @ SY12 ) @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(23,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(24,plain,
! [SV4: $i,SV1: $i] :
( ( ! [SY13: $i] :
( ( divide @ SV1 @ ( divide @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SV4 ) @ SY13 ) @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SV1 ) @ SY13 ) ) )
= SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV5: $i,SV2: $i] :
( ( ! [SY14: $i] :
( ( multiply @ SV2 @ SV5 )
= ( divide @ SV2 @ ( divide @ ( divide @ SY14 @ SY14 ) @ SV5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV6: $i,SV3: $i] :
( ( ( inverse @ SV3 )
= ( divide @ ( divide @ SV6 @ SV6 ) @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV7: $i,SV4: $i,SV1: $i] :
( ( ( divide @ SV1 @ ( divide @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SV4 ) @ SV7 ) @ ( divide @ ( divide @ ( divide @ SV1 @ SV1 ) @ SV1 ) @ SV7 ) ) )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(28,plain,
! [SV8: $i,SV5: $i,SV2: $i] :
( ( ( multiply @ SV2 @ SV5 )
= ( divide @ SV2 @ ( divide @ ( divide @ SV8 @ SV8 ) @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(29,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,28,27,26,23]) ).
thf(30,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n012.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 Jun 14 03:44:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 4
% 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:4,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:6,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.18/0.39
% 0.18/0.39 ********************************
% 0.18/0.39 * All subproblems solved! *
% 0.18/0.39 ********************************
% 0.18/0.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,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:29,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.39
% 0.18/0.39 %**** Beginning of derivation protocol ****
% 0.18/0.39 % SZS output start CNFRefutation
% See solution above
% 0.18/0.39
% 0.18/0.39 %**** End of derivation protocol ****
% 0.18/0.39 %**** no. of clauses in derivation: 30 ****
% 0.18/0.39 %**** clause counter: 29 ****
% 0.18/0.39
% 0.18/0.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,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:29,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------