TSTP Solution File: HEN005-3 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : HEN005-3 : 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 : 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 12:57:17 EDT 2022
% Result : Unsatisfiable 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 68 ( 50 unt; 7 typ; 0 def)
% Number of atoms : 212 ( 83 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 289 ( 32 ~; 33 |; 0 &; 224 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 84 ( 0 ^ 84 !; 0 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_divide,type,
divide: $i > $i > $i ).
thf(tp_identity,type,
identity: $i ).
thf(tp_less_equal,type,
less_equal: $i > $i > $o ).
thf(tp_zero,type,
zero: $i ).
thf(1,axiom,
! [X: $i] : ( less_equal @ X @ identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_is_largest) ).
thf(2,axiom,
! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ~ ( less_equal @ Y @ X )
| ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_and_equal) ).
thf(3,axiom,
! [X: $i] : ( less_equal @ zero @ X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
thf(4,axiom,
! [X: $i,Z: $i,Y: $i] : ( less_equal @ ( divide @ ( divide @ X @ Z ) @ ( divide @ Y @ Z ) ) @ ( divide @ ( divide @ X @ Y ) @ Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
thf(5,axiom,
! [X: $i,Y: $i] : ( less_equal @ ( divide @ X @ Y ) @ X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_smaller_than_numerator) ).
thf(6,axiom,
! [X: $i,Y: $i] :
( ( ( divide @ X @ Y )
!= zero )
| ( less_equal @ X @ Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal2) ).
thf(7,axiom,
! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ( ( divide @ X @ Y )
= zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal1) ).
thf(8,axiom,
less_equal @ b @ c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_LE_c) ).
thf(9,axiom,
less_equal @ a @ b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
thf(10,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(11,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[10]) ).
thf(12,negated_conjecture,
~ ( less_equal @ a @ c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_LE_c) ).
thf(13,plain,
$false = $false,
inference(unfold_def,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [X: $i] : ( less_equal @ X @ identity ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(15,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ~ ( less_equal @ Y @ X )
| ( X = Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(16,plain,
( ( ! [X: $i] : ( less_equal @ zero @ X ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(17,plain,
( ( ! [X: $i,Z: $i,Y: $i] : ( less_equal @ ( divide @ ( divide @ X @ Z ) @ ( divide @ Y @ Z ) ) @ ( divide @ ( divide @ X @ Y ) @ Z ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(18,plain,
( ( ! [X: $i,Y: $i] : ( less_equal @ ( divide @ X @ Y ) @ X ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(19,plain,
( ( ! [X: $i,Y: $i] :
( ( ( divide @ X @ Y )
!= zero )
| ( less_equal @ X @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(20,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ( ( divide @ X @ Y )
= zero ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(21,plain,
( ( less_equal @ b @ c )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(22,plain,
( ( less_equal @ a @ b )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(23,plain,
( ( ~ ( less_equal @ a @ c ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(24,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[13]) ).
thf(25,plain,
( ( ! [X: $i,Y: $i] :
( ( ( divide @ X @ Y )
!= zero )
| ( less_equal @ X @ Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[19]) ).
thf(26,plain,
( ( ~ ( less_equal @ a @ c ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(27,plain,
( ( less_equal @ a @ b )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(28,plain,
( ( less_equal @ b @ c )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(29,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ( ( divide @ X @ Y )
= zero ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(30,plain,
( ( ! [X: $i,Y: $i] :
( ( ( divide @ X @ Y )
!= zero )
| ( less_equal @ X @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(31,plain,
( ( ! [X: $i,Y: $i] : ( less_equal @ ( divide @ X @ Y ) @ X ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(32,plain,
( ( ! [X: $i,Z: $i,Y: $i] : ( less_equal @ ( divide @ ( divide @ X @ Z ) @ ( divide @ Y @ Z ) ) @ ( divide @ ( divide @ X @ Y ) @ Z ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(33,plain,
( ( ! [X: $i] : ( less_equal @ zero @ X ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(34,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( less_equal @ X @ Y )
| ~ ( less_equal @ Y @ X )
| ( X = Y ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(35,plain,
( ( ! [X: $i] : ( less_equal @ X @ identity ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(36,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(37,plain,
( ( less_equal @ a @ c )
= $false ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(38,plain,
! [SV1: $i] :
( ( ! [SY13: $i] :
( ~ ( less_equal @ SV1 @ SY13 )
| ( ( divide @ SV1 @ SY13 )
= zero ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(39,plain,
! [SV2: $i] :
( ( ! [SY14: $i] :
( ( ( divide @ SV2 @ SY14 )
!= zero )
| ( less_equal @ SV2 @ SY14 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(40,plain,
! [SV3: $i] :
( ( ! [SY15: $i] : ( less_equal @ ( divide @ SV3 @ SY15 ) @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(41,plain,
! [SV4: $i] :
( ( ! [SY16: $i,SY17: $i] : ( less_equal @ ( divide @ ( divide @ SV4 @ SY16 ) @ ( divide @ SY17 @ SY16 ) ) @ ( divide @ ( divide @ SV4 @ SY17 ) @ SY16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(42,plain,
! [SV5: $i] :
( ( less_equal @ zero @ SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(43,plain,
! [SV6: $i] :
( ( ! [SY18: $i] :
( ~ ( less_equal @ SV6 @ SY18 )
| ~ ( less_equal @ SY18 @ SV6 )
| ( SV6 = SY18 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(44,plain,
! [SV7: $i] :
( ( less_equal @ SV7 @ identity )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(45,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(46,plain,
! [SV8: $i,SV1: $i] :
( ( ~ ( less_equal @ SV1 @ SV8 )
| ( ( divide @ SV1 @ SV8 )
= zero ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(47,plain,
! [SV9: $i,SV2: $i] :
( ( ( ( divide @ SV2 @ SV9 )
!= zero )
| ( less_equal @ SV2 @ SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(48,plain,
! [SV10: $i,SV3: $i] :
( ( less_equal @ ( divide @ SV3 @ SV10 ) @ SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(49,plain,
! [SV11: $i,SV4: $i] :
( ( ! [SY19: $i] : ( less_equal @ ( divide @ ( divide @ SV4 @ SV11 ) @ ( divide @ SY19 @ SV11 ) ) @ ( divide @ ( divide @ SV4 @ SY19 ) @ SV11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(50,plain,
! [SV12: $i,SV6: $i] :
( ( ~ ( less_equal @ SV6 @ SV12 )
| ~ ( less_equal @ SV12 @ SV6 )
| ( SV6 = SV12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(51,plain,
! [SV8: $i,SV1: $i] :
( ( ( ~ ( less_equal @ SV1 @ SV8 ) )
= $true )
| ( ( ( divide @ SV1 @ SV8 )
= zero )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(52,plain,
! [SV9: $i,SV2: $i] :
( ( ( ( ( divide @ SV2 @ SV9 )
!= zero ) )
= $true )
| ( ( less_equal @ SV2 @ SV9 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(53,plain,
! [SV13: $i,SV11: $i,SV4: $i] :
( ( less_equal @ ( divide @ ( divide @ SV4 @ SV11 ) @ ( divide @ SV13 @ SV11 ) ) @ ( divide @ ( divide @ SV4 @ SV13 ) @ SV11 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[49]) ).
thf(54,plain,
! [SV12: $i,SV6: $i] :
( ( ( ~ ( less_equal @ SV6 @ SV12 ) )
= $true )
| ( ( ~ ( less_equal @ SV12 @ SV6 )
| ( SV6 = SV12 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(55,plain,
! [SV8: $i,SV1: $i] :
( ( ( less_equal @ SV1 @ SV8 )
= $false )
| ( ( ( divide @ SV1 @ SV8 )
= zero )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(56,plain,
! [SV9: $i,SV2: $i] :
( ( ( ( divide @ SV2 @ SV9 )
= zero )
= $false )
| ( ( less_equal @ SV2 @ SV9 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[52]) ).
thf(57,plain,
! [SV12: $i,SV6: $i] :
( ( ( less_equal @ SV6 @ SV12 )
= $false )
| ( ( ~ ( less_equal @ SV12 @ SV6 )
| ( SV6 = SV12 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(58,plain,
! [SV6: $i,SV12: $i] :
( ( ( ~ ( less_equal @ SV12 @ SV6 ) )
= $true )
| ( ( SV6 = SV12 )
= $true )
| ( ( less_equal @ SV6 @ SV12 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[57]) ).
thf(59,plain,
! [SV6: $i,SV12: $i] :
( ( ( less_equal @ SV12 @ SV6 )
= $false )
| ( ( SV6 = SV12 )
= $true )
| ( ( less_equal @ SV6 @ SV12 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[58]) ).
thf(60,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[27,59,56,55,53,48,45,44,42,37,28]) ).
thf(61,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HEN005-3 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jul 1 14:00:01 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34
% 0.14/0.34 No.of.Axioms: 10
% 0.14/0.34
% 0.14/0.34 Length.of.Defs: 0
% 0.14/0.34
% 0.14/0.34 Contains.Choice.Funs: false
% 0.14/0.35 (rf:0,axioms:10,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:12,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.14/0.40
% 0.14/0.40 ********************************
% 0.14/0.40 * All subproblems solved! *
% 0.14/0.40 ********************************
% 0.14/0.40 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:10,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:60,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.14/0.40
% 0.14/0.40 %**** Beginning of derivation protocol ****
% 0.14/0.40 % SZS output start CNFRefutation
% See solution above
% 0.14/0.40
% 0.14/0.40 %**** End of derivation protocol ****
% 0.14/0.40 %**** no. of clauses in derivation: 61 ****
% 0.14/0.40 %**** clause counter: 60 ****
% 0.14/0.40
% 0.14/0.40 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:10,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:60,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------