TSTP Solution File: GRP660-14 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP660-14 : 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 : n028.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:22 EDT 2022
% Result : Unsatisfiable 3.24s 3.49s
% Output : CNFRefutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 39 unt; 5 typ; 0 def)
% Number of atoms : 101 ( 62 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 178 ( 6 ~; 0 |; 0 &; 172 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 0 ^ 58 !; 0 ?; 58 :)
% 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_x0,type,
x0: $i ).
thf(tp_x1,type,
x1: $i ).
thf(1,axiom,
! [A: $i,B: $i,C: $i] :
( ( mult @ ( mult @ ( mult @ A @ B ) @ C ) @ A )
= ( mult @ A @ ( mult @ B @ ( mult @ C @ A ) ) ) ),
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,
( mult @ ( ld @ x1 @ x1 ) @ x0 )
!= 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 @ ( mult @ A @ B ) @ C ) @ A )
= ( mult @ A @ ( mult @ B @ ( mult @ C @ A ) ) ) ) )
= $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,
( ( ( ( mult @ ( ld @ x1 @ x1 ) @ x0 )
!= x0 ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(16,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(17,plain,
( ( ( ( mult @ ( ld @ x1 @ x1 ) @ x0 )
!= x0 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(18,plain,
( ( ( ( mult @ ( ld @ x1 @ x1 ) @ x0 )
!= 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 @ ( mult @ A @ B ) @ C ) @ A )
= ( mult @ A @ ( mult @ B @ ( mult @ C @ A ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(24,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(25,plain,
( ( ( mult @ ( ld @ x1 @ x1 ) @ x0 )
= x0 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(26,plain,
! [SV1: $i] :
( ( ! [SY11: $i] :
( ( mult @ SV1 @ ( ld @ SV1 @ SY11 ) )
= SY11 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(27,plain,
! [SV2: $i] :
( ( ! [SY12: $i] :
( ( ld @ SV2 @ ( mult @ SV2 @ SY12 ) )
= SY12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(28,plain,
! [SV3: $i] :
( ( ! [SY13: $i] :
( ( mult @ ( rd @ SV3 @ SY13 ) @ SY13 )
= SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(29,plain,
! [SV4: $i] :
( ( ! [SY14: $i] :
( ( rd @ ( mult @ SV4 @ SY14 ) @ SY14 )
= SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(30,plain,
! [SV5: $i] :
( ( ! [SY15: $i,SY16: $i] :
( ( mult @ ( mult @ ( mult @ SV5 @ SY15 ) @ SY16 ) @ SV5 )
= ( mult @ SV5 @ ( mult @ SY15 @ ( mult @ SY16 @ SV5 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(32,plain,
! [SV6: $i,SV1: $i] :
( ( ( mult @ SV1 @ ( ld @ SV1 @ SV6 ) )
= SV6 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(33,plain,
! [SV7: $i,SV2: $i] :
( ( ( ld @ SV2 @ ( mult @ SV2 @ SV7 ) )
= SV7 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(34,plain,
! [SV8: $i,SV3: $i] :
( ( ( mult @ ( rd @ SV3 @ SV8 ) @ SV8 )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(35,plain,
! [SV9: $i,SV4: $i] :
( ( ( rd @ ( mult @ SV4 @ SV9 ) @ SV9 )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(36,plain,
! [SV10: $i,SV5: $i] :
( ( ! [SY17: $i] :
( ( mult @ ( mult @ ( mult @ SV5 @ SV10 ) @ SY17 ) @ SV5 )
= ( mult @ SV5 @ ( mult @ SV10 @ ( mult @ SY17 @ SV5 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(37,plain,
! [SV11: $i,SV10: $i,SV5: $i] :
( ( ( mult @ ( mult @ ( mult @ SV5 @ SV10 ) @ SV11 ) @ SV5 )
= ( mult @ SV5 @ ( mult @ SV10 @ ( mult @ SV11 @ SV5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(38,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[25,37,35,34,33,32,31]) ).
thf(39,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP660-14 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 23:11:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 6
% 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.35 (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).
% 3.24/3.49
% 3.24/3.49 ********************************
% 3.24/3.49 * All subproblems solved! *
% 3.24/3.49 ********************************
% 3.24/3.49 % 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:38,loop_count:0,foatp_calls:1,translation:fof_full)
% 3.24/3.49
% 3.24/3.49 %**** Beginning of derivation protocol ****
% 3.24/3.49 % SZS output start CNFRefutation
% See solution above
% 3.24/3.49
% 3.24/3.49 %**** End of derivation protocol ****
% 3.24/3.49 %**** no. of clauses in derivation: 39 ****
% 3.24/3.49 %**** clause counter: 38 ****
% 3.24/3.49
% 3.24/3.49 % 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:38,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------