TSTP Solution File: LAT392-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LAT392-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n011.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 : Sun Jul 17 05:48:15 EDT 2022
% Result : Unsatisfiable 22.13s 22.38s
% Output : CNFRefutation 22.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 24 unt; 5 typ; 0 def)
% Number of atoms : 64 ( 36 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 860 ( 6 ~; 0 |; 0 &; 854 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 ^ 88 !; 0 ?; 88 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_mult,type,
mult: $i > $i > $i ).
thf(tp_plus,type,
plus: $i > $i > $i ).
thf(1,axiom,
! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,V6: $i,V7: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) @ ( plus @ ( mult @ ( plus @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) @ ( plus @ ( mult @ ( plus @ B @ ( plus @ ( plus @ ( mult @ D @ ( mult @ B @ E ) ) @ ( mult @ F @ B ) ) @ B ) ) @ ( plus @ V6 @ ( mult @ B @ ( plus @ ( plus @ ( mult @ B @ V7 ) @ ( mult @ F @ B ) ) @ B ) ) ) ) @ ( mult @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) ) ) @ ( mult @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
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,
( plus @ ( plus @ ( mult @ a @ b ) @ ( mult @ b @ c ) ) @ b )
!= b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
thf(5,plain,
$false = $false,
inference(unfold_def,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,V6: $i,V7: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) @ ( plus @ ( mult @ ( plus @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) @ ( plus @ ( mult @ ( plus @ B @ ( plus @ ( plus @ ( mult @ D @ ( mult @ B @ E ) ) @ ( mult @ F @ B ) ) @ B ) ) @ ( plus @ V6 @ ( mult @ B @ ( plus @ ( plus @ ( mult @ B @ V7 ) @ ( mult @ F @ B ) ) @ B ) ) ) ) @ ( mult @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) ) ) @ ( mult @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ( ( plus @ ( plus @ ( mult @ a @ b ) @ ( mult @ b @ c ) ) @ b )
!= b ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(8,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ( plus @ ( plus @ ( mult @ a @ b ) @ ( mult @ b @ c ) ) @ b )
!= b ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ( ( plus @ ( plus @ ( mult @ a @ b ) @ ( mult @ b @ c ) ) @ b )
!= b ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,V6: $i,V7: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) @ ( plus @ ( mult @ ( plus @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) @ ( plus @ ( mult @ ( plus @ B @ ( plus @ ( plus @ ( mult @ D @ ( mult @ B @ E ) ) @ ( mult @ F @ B ) ) @ B ) ) @ ( plus @ V6 @ ( mult @ B @ ( plus @ ( plus @ ( mult @ B @ V7 ) @ ( mult @ F @ B ) ) @ B ) ) ) ) @ ( mult @ A @ ( mult @ ( mult @ ( plus @ D @ B ) @ ( plus @ B @ E ) ) @ B ) ) ) ) @ ( mult @ ( mult @ ( plus @ A @ B ) @ ( plus @ B @ ( mult @ A @ B ) ) ) @ C ) ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ( plus @ ( plus @ ( mult @ a @ b ) @ ( mult @ b @ c ) ) @ b )
= b )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV1: $i] :
( ( ! [SY8: $i,SY9: $i,SY10: $i,SY11: $i,SY12: $i,SY13: $i,SY14: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SY8 ) @ ( plus @ SY8 @ ( mult @ SV1 @ SY8 ) ) ) @ SY9 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SY10 @ SY8 ) @ ( plus @ SY8 @ SY11 ) ) @ SY8 ) ) @ ( plus @ ( mult @ ( plus @ SY8 @ ( plus @ ( plus @ ( mult @ SY10 @ ( mult @ SY8 @ SY11 ) ) @ ( mult @ SY12 @ SY8 ) ) @ SY8 ) ) @ ( plus @ SY13 @ ( mult @ SY8 @ ( plus @ ( plus @ ( mult @ SY8 @ SY14 ) @ ( mult @ SY12 @ SY8 ) ) @ SY8 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SY10 @ SY8 ) @ ( plus @ SY8 @ SY11 ) ) @ SY8 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SY8 ) @ ( plus @ SY8 @ ( mult @ SV1 @ SY8 ) ) ) @ SY9 ) ) )
= SY8 ) )
= $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] :
( ( ! [SY15: $i,SY16: $i,SY17: $i,SY18: $i,SY19: $i,SY20: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SY15 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SY16 @ SV2 ) @ ( plus @ SV2 @ SY17 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SY16 @ ( mult @ SV2 @ SY17 ) ) @ ( mult @ SY18 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SY19 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY20 ) @ ( mult @ SY18 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SY16 @ SV2 ) @ ( plus @ SV2 @ SY17 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SY15 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY21: $i,SY22: $i,SY23: $i,SY24: $i,SY25: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SY21 @ SV2 ) @ ( plus @ SV2 @ SY22 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SY21 @ ( mult @ SV2 @ SY22 ) ) @ ( mult @ SY23 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SY24 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY25 ) @ ( mult @ SY23 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SY21 @ SV2 ) @ ( plus @ SV2 @ SY22 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(18,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY26: $i,SY27: $i,SY28: $i,SY29: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SY26 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SV4 @ ( mult @ SV2 @ SY26 ) ) @ ( mult @ SY27 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SY28 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY29 ) @ ( mult @ SY27 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SY26 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(19,plain,
! [SV5: $i,SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY30: $i,SY31: $i,SY32: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SV4 @ ( mult @ SV2 @ SV5 ) ) @ ( mult @ SY30 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SY31 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY32 ) @ ( mult @ SY30 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(20,plain,
! [SV6: $i,SV5: $i,SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY33: $i,SY34: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SV4 @ ( mult @ SV2 @ SV5 ) ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SY33 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY34 ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(21,plain,
! [SV7: $i,SV6: $i,SV5: $i,SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY35: $i] :
( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SV4 @ ( mult @ SV2 @ SV5 ) ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SV7 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SY35 ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(22,plain,
! [SV8: $i,SV7: $i,SV6: $i,SV5: $i,SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ( mult @ ( plus @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) @ ( plus @ ( mult @ ( plus @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) @ ( plus @ ( mult @ ( plus @ SV2 @ ( plus @ ( plus @ ( mult @ SV4 @ ( mult @ SV2 @ SV5 ) ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) @ ( plus @ SV7 @ ( mult @ SV2 @ ( plus @ ( plus @ ( mult @ SV2 @ SV8 ) @ ( mult @ SV6 @ SV2 ) ) @ SV2 ) ) ) ) @ ( mult @ SV1 @ ( mult @ ( mult @ ( plus @ SV4 @ SV2 ) @ ( plus @ SV2 @ SV5 ) ) @ SV2 ) ) ) ) @ ( mult @ ( mult @ ( plus @ SV1 @ SV2 ) @ ( plus @ SV2 @ ( mult @ SV1 @ SV2 ) ) ) @ SV3 ) ) )
= SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(23,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[13,22,15]) ).
thf(24,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LAT392-1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n011.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 : Wed Jun 29 14:30:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36
% 0.13/0.36 No.of.Axioms: 2
% 0.13/0.36
% 0.13/0.36 Length.of.Defs: 0
% 0.13/0.36
% 0.13/0.36 Contains.Choice.Funs: false
% 0.13/0.38 (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)..
% 22.13/22.38
% 22.13/22.38 ********************************
% 22.13/22.38 * All subproblems solved! *
% 22.13/22.38 ********************************
% 22.13/22.38 % 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)
% 22.13/22.38
% 22.13/22.38 %**** Beginning of derivation protocol ****
% 22.13/22.38 % SZS output start CNFRefutation
% See solution above
% 22.13/22.38
% 22.13/22.38 %**** End of derivation protocol ****
% 22.13/22.38 %**** no. of clauses in derivation: 24 ****
% 22.13/22.38 %**** clause counter: 23 ****
% 22.13/22.38
% 22.13/22.38 % 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)
%------------------------------------------------------------------------------