TSTP Solution File: GRP469-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP469-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 : n015.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:10 EDT 2022
% Result : Unsatisfiable 124.12s 124.32s
% Output : CNFRefutation 124.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 64 ( 42 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 154 ( 4 ~; 2 |; 0 &; 148 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 38 ( 0 ^ 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a1,type,
a1: $i ).
thf(tp_b1,type,
b1: $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] :
( ( multiply @ A @ B )
= ( divide @ A @ ( inverse @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
thf(2,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( divide @ ( inverse @ ( divide @ A @ ( divide @ B @ ( divide @ C @ D ) ) ) ) @ ( divide @ ( divide @ D @ C ) @ A ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
thf(5,negated_conjecture,
( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
thf(7,plain,
( ( ! [A: $i,B: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( inverse @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( divide @ ( inverse @ ( divide @ A @ ( divide @ B @ ( divide @ C @ D ) ) ) ) @ ( divide @ ( divide @ D @ C ) @ A ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(11,plain,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(13,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( divide @ ( inverse @ ( divide @ A @ ( divide @ B @ ( divide @ C @ D ) ) ) ) @ ( divide @ ( divide @ D @ C ) @ A ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( ! [A: $i,B: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( inverse @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(16,plain,
( ( ( multiply @ ( inverse @ a1 ) @ a1 )
= ( multiply @ ( inverse @ b1 ) @ b1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(17,plain,
! [SV1: $i] :
( ( ! [SY6: $i,SY7: $i,SY8: $i] :
( ( divide @ ( inverse @ ( divide @ SV1 @ ( divide @ SY6 @ ( divide @ SY7 @ SY8 ) ) ) ) @ ( divide @ ( divide @ SY8 @ SY7 ) @ SV1 ) )
= SY6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(18,plain,
! [SV2: $i] :
( ( ! [SY9: $i] :
( ( multiply @ SV2 @ SY9 )
= ( divide @ SV2 @ ( inverse @ SY9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(20,plain,
! [SV3: $i,SV1: $i] :
( ( ! [SY10: $i,SY11: $i] :
( ( divide @ ( inverse @ ( divide @ SV1 @ ( divide @ SV3 @ ( divide @ SY10 @ SY11 ) ) ) ) @ ( divide @ ( divide @ SY11 @ SY10 ) @ SV1 ) )
= SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(21,plain,
! [SV4: $i,SV2: $i] :
( ( ( multiply @ SV2 @ SV4 )
= ( divide @ SV2 @ ( inverse @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(22,plain,
! [SV5: $i,SV3: $i,SV1: $i] :
( ( ! [SY12: $i] :
( ( divide @ ( inverse @ ( divide @ SV1 @ ( divide @ SV3 @ ( divide @ SV5 @ SY12 ) ) ) ) @ ( divide @ ( divide @ SY12 @ SV5 ) @ SV1 ) )
= SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV6: $i,SV5: $i,SV3: $i,SV1: $i] :
( ( ( divide @ ( inverse @ ( divide @ SV1 @ ( divide @ SV3 @ ( divide @ SV5 @ SV6 ) ) ) ) @ ( divide @ ( divide @ SV6 @ SV5 ) @ SV1 ) )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(24,plain,
( ( ( a1 = b1 )
= $false )
| ( ( a1 = b1 )
= $false ) ),
inference(extuni,[status(esa)],[16]) ).
thf(25,plain,
( ( ( a1 = b1 )
= $false )
| ( ( ( inverse @ a1 )
= ( inverse @ b1 ) )
= $false ) ),
inference(extuni,[status(esa)],[16]) ).
thf(26,plain,
( ( a1 = b1 )
= $false ),
inference(sim,[status(thm)],[24]) ).
thf(27,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,26,25,23,21]) ).
thf(28,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP469-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 17:01:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35
% 0.14/0.35 No.of.Axioms: 3
% 0.14/0.35
% 0.14/0.35 Length.of.Defs: 0
% 0.14/0.35
% 0.14/0.35 Contains.Choice.Funs: false
% 0.14/0.35 (rf:0,axioms:3,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:5,loop_count:0,foatp_calls:0,translation:fof_full).eprover: CPU time limit exceeded, terminating
% 124.12/124.32
% 124.12/124.32
% 124.12/124.32 ********************************
% 124.12/124.32 * All subproblems solved! *
% 124.12/124.32 ********************************
% 124.12/124.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:27,loop_count:0,foatp_calls:2,translation:fof_full)
% 124.12/124.32
% 124.12/124.32 %**** Beginning of derivation protocol ****
% 124.12/124.32 % SZS output start CNFRefutation
% See solution above
% 124.12/124.32
% 124.12/124.32 %**** End of derivation protocol ****
% 124.12/124.32 %**** no. of clauses in derivation: 22 ****
% 124.12/124.32 %**** clause counter: 27 ****
% 124.12/124.32
% 124.12/124.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:27,loop_count:0,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------