TSTP Solution File: GRP432-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP432-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 : n032.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:00 EDT 2022
% Result : Unsatisfiable 4.69s 4.87s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 52 ( 28 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 151 ( 6 ~; 0 |; 0 &; 145 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a3,type,
a3: $i ).
thf(tp_b3,type,
b3: $i ).
thf(tp_c3,type,
c3: $i ).
thf(tp_inverse,type,
inverse: $i > $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( multiply @ A @ ( inverse @ ( multiply @ B @ ( multiply @ ( multiply @ ( multiply @ C @ ( inverse @ C ) ) @ ( inverse @ ( multiply @ D @ B ) ) ) @ A ) ) ) )
= D ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
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,
( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
thf(5,plain,
$false = $false,
inference(unfold_def,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( multiply @ A @ ( inverse @ ( multiply @ B @ ( multiply @ ( multiply @ ( multiply @ C @ ( inverse @ C ) ) @ ( inverse @ ( multiply @ D @ B ) ) ) @ A ) ) ) )
= D ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(8,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( multiply @ A @ ( inverse @ ( multiply @ B @ ( multiply @ ( multiply @ ( multiply @ C @ ( inverse @ C ) ) @ ( inverse @ ( multiply @ D @ B ) ) ) @ A ) ) ) )
= D ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV1: $i] :
( ( ! [SY4: $i,SY5: $i,SY6: $i] :
( ( multiply @ SV1 @ ( inverse @ ( multiply @ SY4 @ ( multiply @ ( multiply @ ( multiply @ SY5 @ ( inverse @ SY5 ) ) @ ( inverse @ ( multiply @ SY6 @ SY4 ) ) ) @ SV1 ) ) ) )
= SY6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY7: $i,SY8: $i] :
( ( multiply @ SV1 @ ( inverse @ ( multiply @ SV2 @ ( multiply @ ( multiply @ ( multiply @ SY7 @ ( inverse @ SY7 ) ) @ ( inverse @ ( multiply @ SY8 @ SV2 ) ) ) @ SV1 ) ) ) )
= SY8 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY9: $i] :
( ( multiply @ SV1 @ ( inverse @ ( multiply @ SV2 @ ( multiply @ ( multiply @ ( multiply @ SV3 @ ( inverse @ SV3 ) ) @ ( inverse @ ( multiply @ SY9 @ SV2 ) ) ) @ SV1 ) ) ) )
= SY9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(18,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ( multiply @ SV1 @ ( inverse @ ( multiply @ SV2 @ ( multiply @ ( multiply @ ( multiply @ SV3 @ ( inverse @ SV3 ) ) @ ( inverse @ ( multiply @ SV4 @ SV2 ) ) ) @ SV1 ) ) ) )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(19,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[13,18,15]) ).
thf(20,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP432-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jun 13 20:40:42 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.32
% 0.11/0.32 No.of.Axioms: 2
% 0.11/0.32
% 0.11/0.32 Length.of.Defs: 0
% 0.11/0.32
% 0.11/0.32 Contains.Choice.Funs: false
% 0.11/0.33 (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)
% 4.69/4.87 ********************************
% 4.69/4.87 * All subproblems solved! *
% 4.69/4.87 ********************************
% 4.69/4.87 % SZS status Unsatisfiable for /export/starexec/sandbox/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:19,loop_count:0,foatp_calls:1,translation:fof_full)
% 4.69/4.87
% 4.69/4.87 %**** Beginning of derivation protocol ****
% 4.69/4.87 % SZS output start CNFRefutation
% See solution above
% 4.69/4.87
% 4.69/4.87 %**** End of derivation protocol ****
% 4.69/4.87 %**** no. of clauses in derivation: 20 ****
% 4.69/4.87 %**** clause counter: 19 ****
% 4.69/4.87
% 4.69/4.87 % SZS status Unsatisfiable for /export/starexec/sandbox/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:19,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------