TSTP Solution File: SYO614-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO614-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n003.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 : Thu Jul 21 17:36:00 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 62 ( 33 unt; 7 typ; 0 def)
% Number of atoms : 260 ( 70 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 463 ( 66 ~; 65 |; 0 &; 332 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 101 ( 0 ^ 101 !; 0 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a0,type,
a0: $i ).
thf(tp_a1,type,
a1: $i ).
thf(tp_eq,type,
eq: $i > $i > $o ).
thf(tp_f,type,
f: $i > $i ).
thf(tp_le,type,
le: $i > $i > $o ).
thf(tp_max,type,
max: $i > $i > $i ).
thf(tp_s,type,
s: $i > $i ).
thf(1,axiom,
! [A0: $i,A1: $i] :
( ~ ( eq @ ( f @ A0 ) @ a1 )
| ~ ( eq @ ( f @ A1 ) @ a1 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
thf(2,axiom,
! [A0: $i,A1: $i] :
( ~ ( eq @ ( f @ A0 ) @ a0 )
| ~ ( eq @ ( f @ A1 ) @ a0 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
thf(3,axiom,
! [A: $i] :
( ( eq @ ( f @ A ) @ a0 )
| ( eq @ ( f @ A ) @ a1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ B @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ A @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
thf(6,axiom,
! [A: $i] : ( le @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
thf(7,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(8,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[7]) ).
thf(9,plain,
$false = $false,
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [A0: $i,A1: $i] :
( ~ ( eq @ ( f @ A0 ) @ a1 )
| ~ ( eq @ ( f @ A1 ) @ a1 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(11,plain,
( ( ! [A0: $i,A1: $i] :
( ~ ( eq @ ( f @ A0 ) @ a0 )
| ~ ( eq @ ( f @ A1 ) @ a0 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(12,plain,
( ( ! [A: $i] :
( ( eq @ ( f @ A ) @ a0 )
| ( eq @ ( f @ A ) @ a1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(13,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ B @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(14,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ A @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(15,plain,
( ( ! [A: $i] : ( le @ A @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(16,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [A0: $i] :
( ~ ( eq @ ( f @ A0 ) @ a1 )
| ! [A1: $i] :
( ~ ( eq @ ( f @ A1 ) @ a1 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(18,plain,
( ( ! [A0: $i] :
( ~ ( eq @ ( f @ A0 ) @ a0 )
| ! [A1: $i] :
( ~ ( eq @ ( f @ A1 ) @ a0 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(19,plain,
( ( ! [A: $i] : ( le @ A @ A ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(20,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ A @ C ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(21,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( le @ ( max @ A @ B ) @ C )
| ( le @ B @ C ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(22,plain,
( ( ! [A: $i] :
( ( eq @ ( f @ A ) @ a0 )
| ( eq @ ( f @ A ) @ a1 ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(23,plain,
( ( ! [A0: $i] :
( ~ ( eq @ ( f @ A0 ) @ a0 )
| ! [A1: $i] :
( ~ ( eq @ ( f @ A1 ) @ a0 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(24,plain,
( ( ! [A0: $i] :
( ~ ( eq @ ( f @ A0 ) @ a1 )
| ! [A1: $i] :
( ~ ( eq @ ( f @ A1 ) @ a1 )
| ~ ( le @ ( s @ A0 ) @ A1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(25,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(26,plain,
! [SV1: $i] :
( ( le @ SV1 @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(27,plain,
! [SV2: $i] :
( ( ! [SY12: $i,SY13: $i] :
( ~ ( le @ ( max @ SV2 @ SY12 ) @ SY13 )
| ( le @ SV2 @ SY13 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(28,plain,
! [SV3: $i] :
( ( ! [SY14: $i,SY15: $i] :
( ~ ( le @ ( max @ SV3 @ SY14 ) @ SY15 )
| ( le @ SY14 @ SY15 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(29,plain,
! [SV4: $i] :
( ( ( eq @ ( f @ SV4 ) @ a0 )
| ( eq @ ( f @ SV4 ) @ a1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(30,plain,
! [SV5: $i] :
( ( ~ ( eq @ ( f @ SV5 ) @ a0 )
| ! [SY16: $i] :
( ~ ( eq @ ( f @ SY16 ) @ a0 )
| ~ ( le @ ( s @ SV5 ) @ SY16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
! [SV6: $i] :
( ( ~ ( eq @ ( f @ SV6 ) @ a1 )
| ! [SY17: $i] :
( ~ ( eq @ ( f @ SY17 ) @ a1 )
| ~ ( le @ ( s @ SV6 ) @ SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(32,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(33,plain,
! [SV7: $i,SV2: $i] :
( ( ! [SY18: $i] :
( ~ ( le @ ( max @ SV2 @ SV7 ) @ SY18 )
| ( le @ SV2 @ SY18 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(34,plain,
! [SV8: $i,SV3: $i] :
( ( ! [SY19: $i] :
( ~ ( le @ ( max @ SV3 @ SV8 ) @ SY19 )
| ( le @ SV8 @ SY19 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(35,plain,
! [SV4: $i] :
( ( ( eq @ ( f @ SV4 ) @ a0 )
= $true )
| ( ( eq @ ( f @ SV4 ) @ a1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[29]) ).
thf(36,plain,
! [SV5: $i] :
( ( ( ~ ( eq @ ( f @ SV5 ) @ a0 ) )
= $true )
| ( ( ! [SY16: $i] :
( ~ ( eq @ ( f @ SY16 ) @ a0 )
| ~ ( le @ ( s @ SV5 ) @ SY16 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[30]) ).
thf(37,plain,
! [SV6: $i] :
( ( ( ~ ( eq @ ( f @ SV6 ) @ a1 ) )
= $true )
| ( ( ! [SY17: $i] :
( ~ ( eq @ ( f @ SY17 ) @ a1 )
| ~ ( le @ ( s @ SV6 ) @ SY17 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(38,plain,
! [SV9: $i,SV7: $i,SV2: $i] :
( ( ~ ( le @ ( max @ SV2 @ SV7 ) @ SV9 )
| ( le @ SV2 @ SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(39,plain,
! [SV10: $i,SV8: $i,SV3: $i] :
( ( ~ ( le @ ( max @ SV3 @ SV8 ) @ SV10 )
| ( le @ SV8 @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(40,plain,
! [SV5: $i] :
( ( ( eq @ ( f @ SV5 ) @ a0 )
= $false )
| ( ( ! [SY16: $i] :
( ~ ( eq @ ( f @ SY16 ) @ a0 )
| ~ ( le @ ( s @ SV5 ) @ SY16 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(41,plain,
! [SV6: $i] :
( ( ( eq @ ( f @ SV6 ) @ a1 )
= $false )
| ( ( ! [SY17: $i] :
( ~ ( eq @ ( f @ SY17 ) @ a1 )
| ~ ( le @ ( s @ SV6 ) @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(42,plain,
! [SV9: $i,SV7: $i,SV2: $i] :
( ( ( ~ ( le @ ( max @ SV2 @ SV7 ) @ SV9 ) )
= $true )
| ( ( le @ SV2 @ SV9 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[38]) ).
thf(43,plain,
! [SV10: $i,SV8: $i,SV3: $i] :
( ( ( ~ ( le @ ( max @ SV3 @ SV8 ) @ SV10 ) )
= $true )
| ( ( le @ SV8 @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[39]) ).
thf(44,plain,
! [SV5: $i,SV11: $i] :
( ( ( ~ ( eq @ ( f @ SV11 ) @ a0 )
| ~ ( le @ ( s @ SV5 ) @ SV11 ) )
= $true )
| ( ( eq @ ( f @ SV5 ) @ a0 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(45,plain,
! [SV6: $i,SV12: $i] :
( ( ( ~ ( eq @ ( f @ SV12 ) @ a1 )
| ~ ( le @ ( s @ SV6 ) @ SV12 ) )
= $true )
| ( ( eq @ ( f @ SV6 ) @ a1 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(46,plain,
! [SV9: $i,SV7: $i,SV2: $i] :
( ( ( le @ ( max @ SV2 @ SV7 ) @ SV9 )
= $false )
| ( ( le @ SV2 @ SV9 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[42]) ).
thf(47,plain,
! [SV10: $i,SV8: $i,SV3: $i] :
( ( ( le @ ( max @ SV3 @ SV8 ) @ SV10 )
= $false )
| ( ( le @ SV8 @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(48,plain,
! [SV5: $i,SV11: $i] :
( ( ( ~ ( eq @ ( f @ SV11 ) @ a0 ) )
= $true )
| ( ( ~ ( le @ ( s @ SV5 ) @ SV11 ) )
= $true )
| ( ( eq @ ( f @ SV5 ) @ a0 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(49,plain,
! [SV6: $i,SV12: $i] :
( ( ( ~ ( eq @ ( f @ SV12 ) @ a1 ) )
= $true )
| ( ( ~ ( le @ ( s @ SV6 ) @ SV12 ) )
= $true )
| ( ( eq @ ( f @ SV6 ) @ a1 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[45]) ).
thf(50,plain,
! [SV5: $i,SV11: $i] :
( ( ( eq @ ( f @ SV11 ) @ a0 )
= $false )
| ( ( ~ ( le @ ( s @ SV5 ) @ SV11 ) )
= $true )
| ( ( eq @ ( f @ SV5 ) @ a0 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(51,plain,
! [SV6: $i,SV12: $i] :
( ( ( eq @ ( f @ SV12 ) @ a1 )
= $false )
| ( ( ~ ( le @ ( s @ SV6 ) @ SV12 ) )
= $true )
| ( ( eq @ ( f @ SV6 ) @ a1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(52,plain,
! [SV11: $i,SV5: $i] :
( ( ( le @ ( s @ SV5 ) @ SV11 )
= $false )
| ( ( eq @ ( f @ SV11 ) @ a0 )
= $false )
| ( ( eq @ ( f @ SV5 ) @ a0 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(53,plain,
! [SV12: $i,SV6: $i] :
( ( ( le @ ( s @ SV6 ) @ SV12 )
= $false )
| ( ( eq @ ( f @ SV12 ) @ a1 )
= $false )
| ( ( eq @ ( f @ SV6 ) @ a1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(54,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[26,53,52,47,46,35,32]) ).
thf(55,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYO614-1 : TPTP v8.1.0. Released v7.1.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 11:44:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 6
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (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.12/0.38
% 0.12/0.38 ********************************
% 0.12/0.38 * All subproblems solved! *
% 0.12/0.38 ********************************
% 0.12/0.38 % 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:54,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.38
% 0.12/0.38 %**** Beginning of derivation protocol ****
% 0.12/0.38 % SZS output start CNFRefutation
% See solution above
% 0.12/0.38
% 0.12/0.38 %**** End of derivation protocol ****
% 0.12/0.38 %**** no. of clauses in derivation: 55 ****
% 0.12/0.38 %**** clause counter: 54 ****
% 0.12/0.38
% 0.12/0.38 % 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:54,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------