TSTP Solution File: GRP658-10 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n026.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:19:20 EDT 2022
% Result : Unsatisfiable 0.60s 0.77s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 40 unt; 6 typ; 0 def)
% Number of atoms : 104 ( 64 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 231 ( 7 ~; 0 |; 0 &; 224 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 ^ 64 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_ld,type,
ld: $i > $i > $i ).
thf(tp_mult,type,
mult: $i > $i > $i ).
thf(tp_rd,type,
rd: $i > $i > $i ).
thf(tp_tuple,type,
tuple: $i > $i > $i ).
thf(tp_x1,type,
x1: $i > $i ).
thf(tp_x1_2,type,
x1_2: $i > $i ).
thf(1,axiom,
! [A: $i,B: $i,C: $i] :
( ( mult @ ( mult @ A @ ( mult @ B @ B ) ) @ C )
= ( mult @ ( mult @ A @ B ) @ ( mult @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
thf(2,axiom,
! [A: $i,B: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
thf(6,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(7,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[6]) ).
thf(8,negated_conjecture,
! [X0: $i] :
( ( tuple @ ( mult @ X0 @ ( x1 @ X0 ) ) @ ( mult @ ( x1_2 @ X0 ) @ X0 ) )
!= ( tuple @ ( x1 @ X0 ) @ ( x1_2 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
thf(9,plain,
$false = $false,
inference(unfold_def,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( mult @ ( mult @ A @ ( mult @ B @ B ) ) @ C )
= ( mult @ ( mult @ A @ B ) @ ( mult @ B @ C ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(11,plain,
( ( ! [A: $i,B: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(13,plain,
( ( ! [A: $i,B: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(14,plain,
( ( ! [A: $i,B: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(15,plain,
( ( ! [X0: $i] :
( ( tuple @ ( mult @ X0 @ ( x1 @ X0 ) ) @ ( mult @ ( x1_2 @ X0 ) @ X0 ) )
!= ( tuple @ ( x1 @ X0 ) @ ( x1_2 @ X0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(16,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [X0: $i] :
( ( tuple @ ( mult @ X0 @ ( x1 @ X0 ) ) @ ( mult @ ( x1_2 @ X0 ) @ X0 ) )
!= ( tuple @ ( x1 @ X0 ) @ ( x1_2 @ X0 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(18,plain,
( ( ! [X0: $i] :
( ( tuple @ ( mult @ X0 @ ( x1 @ X0 ) ) @ ( mult @ ( x1_2 @ X0 ) @ X0 ) )
!= ( tuple @ ( x1 @ X0 ) @ ( x1_2 @ X0 ) ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(20,plain,
( ( ! [A: $i,B: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(21,plain,
( ( ! [A: $i,B: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(22,plain,
( ( ! [A: $i,B: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(23,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( mult @ ( mult @ A @ ( mult @ B @ B ) ) @ C )
= ( mult @ ( mult @ A @ B ) @ ( mult @ B @ C ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(24,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(25,plain,
! [SV1: $i] :
( ( ( ( tuple @ ( mult @ SV1 @ ( x1 @ SV1 ) ) @ ( mult @ ( x1_2 @ SV1 ) @ SV1 ) )
!= ( tuple @ ( x1 @ SV1 ) @ ( x1_2 @ SV1 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(26,plain,
! [SV2: $i] :
( ( ! [SY12: $i] :
( ( mult @ SV2 @ ( ld @ SV2 @ SY12 ) )
= SY12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(27,plain,
! [SV3: $i] :
( ( ! [SY13: $i] :
( ( ld @ SV3 @ ( mult @ SV3 @ SY13 ) )
= SY13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(28,plain,
! [SV4: $i] :
( ( ! [SY14: $i] :
( ( mult @ ( rd @ SV4 @ SY14 ) @ SY14 )
= SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(29,plain,
! [SV5: $i] :
( ( ! [SY15: $i] :
( ( rd @ ( mult @ SV5 @ SY15 ) @ SY15 )
= SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(30,plain,
! [SV6: $i] :
( ( ! [SY16: $i,SY17: $i] :
( ( mult @ ( mult @ SV6 @ ( mult @ SY16 @ SY16 ) ) @ SY17 )
= ( mult @ ( mult @ SV6 @ SY16 ) @ ( mult @ SY16 @ SY17 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(32,plain,
! [SV1: $i] :
( ( ( tuple @ ( mult @ SV1 @ ( x1 @ SV1 ) ) @ ( mult @ ( x1_2 @ SV1 ) @ SV1 ) )
= ( tuple @ ( x1 @ SV1 ) @ ( x1_2 @ SV1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(33,plain,
! [SV7: $i,SV2: $i] :
( ( ( mult @ SV2 @ ( ld @ SV2 @ SV7 ) )
= SV7 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(34,plain,
! [SV8: $i,SV3: $i] :
( ( ( ld @ SV3 @ ( mult @ SV3 @ SV8 ) )
= SV8 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(35,plain,
! [SV9: $i,SV4: $i] :
( ( ( mult @ ( rd @ SV4 @ SV9 ) @ SV9 )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(36,plain,
! [SV10: $i,SV5: $i] :
( ( ( rd @ ( mult @ SV5 @ SV10 ) @ SV10 )
= SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(37,plain,
! [SV11: $i,SV6: $i] :
( ( ! [SY18: $i] :
( ( mult @ ( mult @ SV6 @ ( mult @ SV11 @ SV11 ) ) @ SY18 )
= ( mult @ ( mult @ SV6 @ SV11 ) @ ( mult @ SV11 @ SY18 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(38,plain,
! [SV12: $i,SV11: $i,SV6: $i] :
( ( ( mult @ ( mult @ SV6 @ ( mult @ SV11 @ SV11 ) ) @ SV12 )
= ( mult @ ( mult @ SV6 @ SV11 ) @ ( mult @ SV11 @ SV12 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(39,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[31,38,36,35,34,33,32]) ).
thf(40,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% 0.13/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 02:13:51 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37
% 0.15/0.37 No.of.Axioms: 6
% 0.15/0.37
% 0.15/0.37 Length.of.Defs: 0
% 0.15/0.37
% 0.15/0.37 Contains.Choice.Funs: false
% 0.15/0.37 (rf:0,axioms:6,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:8,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.60/0.77
% 0.60/0.77 ********************************
% 0.60/0.77 * All subproblems solved! *
% 0.60/0.77 ********************************
% 0.60/0.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:6,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.60/0.77
% 0.60/0.77 %**** Beginning of derivation protocol ****
% 0.60/0.77 % SZS output start CNFRefutation
% See solution above
% 0.60/0.77
% 0.60/0.77 %**** End of derivation protocol ****
% 0.60/0.77 %**** no. of clauses in derivation: 40 ****
% 0.60/0.77 %**** clause counter: 39 ****
% 0.60/0.77
% 0.60/0.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:6,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------