TSTP Solution File: GRP058-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP058-1 : TPTP v8.1.0. Released v1.0.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:15:42 EDT 2022
% Result : Unsatisfiable 4.29s 4.48s
% Output : CNFRefutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 18 unt; 9 typ; 0 def)
% Number of atoms : 98 ( 62 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 316 ( 22 ~; 18 |; 0 &; 276 @)
% ( 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 : 12 ( 9 usr; 9 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a1,type,
a1: $i ).
thf(tp_a2,type,
a2: $i ).
thf(tp_a3,type,
a3: $i ).
thf(tp_b1,type,
b1: $i ).
thf(tp_b2,type,
b2: $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,
! [X: $i,Y: $i,Z: $i,U: $i] :
( ( multiply @ X @ ( inverse @ ( multiply @ Y @ ( multiply @ ( multiply @ ( multiply @ Z @ ( inverse @ Z ) ) @ ( inverse @ ( multiply @ U @ Y ) ) ) @ X ) ) ) )
= U ),
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 @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) )
| ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
thf(5,plain,
$false = $false,
inference(unfold_def,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [X: $i,Y: $i,Z: $i,U: $i] :
( ( multiply @ X @ ( inverse @ ( multiply @ Y @ ( multiply @ ( multiply @ ( multiply @ Z @ ( inverse @ Z ) ) @ ( inverse @ ( multiply @ U @ Y ) ) ) @ X ) ) ) )
= U ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) )
| ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( 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 @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) )
| ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) )
| ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [X: $i,Y: $i,Z: $i,U: $i] :
( ( multiply @ X @ ( inverse @ ( multiply @ Y @ ( multiply @ ( multiply @ ( multiply @ Z @ ( inverse @ Z ) ) @ ( inverse @ ( multiply @ U @ Y ) ) ) @ X ) ) ) )
= U ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ) )
= $true )
| ( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ) ),
inference(extcnf_or_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,
( ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
= ( multiply @ ( inverse @ b1 ) @ b1 ) )
= $false )
| ( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 )
| ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(17,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(18,plain,
( ( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
!= a2 ) )
= $true )
| ( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true )
| ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
= ( multiply @ ( inverse @ b1 ) @ b1 ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(19,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)],[17]) ).
thf(20,plain,
( ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
= a2 )
= $false )
| ( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ) )
= $true )
| ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
= ( multiply @ ( inverse @ b1 ) @ b1 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,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)],[19]) ).
thf(22,plain,
( ( ( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) )
= $false )
| ( ( ( multiply @ ( multiply @ ( inverse @ b2 ) @ b2 ) @ a2 )
= a2 )
= $false )
| ( ( ( multiply @ ( inverse @ a1 ) @ a1 )
= ( multiply @ ( inverse @ b1 ) @ b1 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(23,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,22,21]) ).
thf(24,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.11 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Tue Jun 14 04:15:27 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.16/0.31
% 0.16/0.31 No.of.Axioms: 2
% 0.16/0.31
% 0.16/0.31 Length.of.Defs: 0
% 0.16/0.31
% 0.16/0.31 Contains.Choice.Funs: false
% 0.16/0.31 (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.29/4.48 ********************************
% 4.29/4.48 * All subproblems solved! *
% 4.29/4.48 ********************************
% 4.29/4.48 % 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:23,loop_count:0,foatp_calls:1,translation:fof_full)
% 4.29/4.48
% 4.29/4.48 %**** Beginning of derivation protocol ****
% 4.29/4.48 % SZS output start CNFRefutation
% See solution above
% 4.29/4.48
% 4.29/4.48 %**** End of derivation protocol ****
% 4.29/4.48 %**** no. of clauses in derivation: 24 ****
% 4.29/4.48 %**** clause counter: 23 ****
% 4.29/4.48
% 4.29/4.48 % 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:23,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------