TSTP Solution File: GRP203-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP203-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n025.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:16:56 EDT 2022
% Result : Unsatisfiable 13.65s 13.88s
% Output : CNFRefutation 13.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 27 unt; 6 typ; 0 def)
% Number of atoms : 69 ( 40 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 158 ( 6 ~; 0 |; 0 &; 152 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_identity,type,
identity: $i ).
thf(tp_left_inverse,type,
left_inverse: $i > $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ ( multiply @ X @ Y ) @ X ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ ( multiply @ X @ Z ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',moufang3) ).
thf(2,axiom,
! [X: $i] :
( ( multiply @ ( left_inverse @ X ) @ X )
= identity ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
thf(3,axiom,
! [X: $i] :
( ( multiply @ identity @ X )
= X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
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 @ ( multiply @ a @ b ) @ c ) @ b )
!= ( multiply @ a @ ( multiply @ b @ ( multiply @ c @ b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_moufang2) ).
thf(7,plain,
$false = $false,
inference(unfold_def,[status(thm)],[5]) ).
thf(8,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ ( multiply @ X @ Y ) @ X ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ ( multiply @ X @ Z ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [X: $i] :
( ( multiply @ ( left_inverse @ X ) @ X )
= identity ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [X: $i] :
( ( multiply @ identity @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ c ) @ b )
!= ( multiply @ a @ ( multiply @ b @ ( multiply @ c @ b ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ c ) @ b )
!= ( multiply @ a @ ( multiply @ b @ ( multiply @ c @ b ) ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(14,plain,
( ( ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ c ) @ b )
!= ( multiply @ a @ ( multiply @ b @ ( multiply @ c @ b ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(15,plain,
( ( ! [X: $i] :
( ( multiply @ identity @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ! [X: $i] :
( ( multiply @ ( left_inverse @ X ) @ X )
= identity ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ ( multiply @ X @ Y ) @ X ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ ( multiply @ X @ Z ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(18,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(19,plain,
( ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ c ) @ b )
= ( multiply @ a @ ( multiply @ b @ ( multiply @ c @ b ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(20,plain,
! [SV1: $i] :
( ( ( multiply @ identity @ SV1 )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(21,plain,
! [SV2: $i] :
( ( ( multiply @ ( left_inverse @ SV2 ) @ SV2 )
= identity )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(22,plain,
! [SV3: $i] :
( ( ! [SY5: $i,SY6: $i] :
( ( multiply @ ( multiply @ ( multiply @ SV3 @ SY5 ) @ SV3 ) @ SY6 )
= ( multiply @ SV3 @ ( multiply @ SY5 @ ( multiply @ SV3 @ SY6 ) ) ) ) )
= $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,SV3: $i] :
( ( ! [SY7: $i] :
( ( multiply @ ( multiply @ ( multiply @ SV3 @ SV4 ) @ SV3 ) @ SY7 )
= ( multiply @ SV3 @ ( multiply @ SV4 @ ( multiply @ SV3 @ SY7 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(25,plain,
! [SV5: $i,SV4: $i,SV3: $i] :
( ( ( multiply @ ( multiply @ ( multiply @ SV3 @ SV4 ) @ SV3 ) @ SV5 )
= ( multiply @ SV3 @ ( multiply @ SV4 @ ( multiply @ SV3 @ SV5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,25,23,21,20]) ).
thf(27,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP203-1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 11:40:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 4
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/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).
% 13.65/13.88
% 13.65/13.88 ********************************
% 13.65/13.88 * All subproblems solved! *
% 13.65/13.88 ********************************
% 13.65/13.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/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:26,loop_count:0,foatp_calls:1,translation:fof_full)
% 13.65/13.88
% 13.65/13.88 %**** Beginning of derivation protocol ****
% 13.65/13.88 % SZS output start CNFRefutation
% See solution above
% 13.65/13.88
% 13.65/13.88 %**** End of derivation protocol ****
% 13.65/13.88 %**** no. of clauses in derivation: 27 ****
% 13.65/13.88 %**** clause counter: 26 ****
% 13.65/13.88
% 13.65/13.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/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:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------