TSTP Solution File: NUM676^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM676^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n029.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 : Mon Jul 18 11:54:05 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 19 unt; 7 typ; 0 def)
% Number of atoms : 74 ( 24 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 130 ( 7 ~; 7 |; 0 &; 114 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_nat,type,
nat: $tType ).
thf(tp_more,type,
more: nat > nat > $o ).
thf(tp_pl,type,
pl: nat > nat > nat ).
thf(tp_u,type,
u: nat ).
thf(tp_x,type,
x: nat ).
thf(tp_y,type,
y: nat ).
thf(tp_z,type,
z: nat ).
thf(1,axiom,
! [Xx: nat,Xy: nat,Xz: nat] :
( ( more @ Xx @ Xy )
=> ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19d) ).
thf(2,axiom,
more @ z @ u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(3,axiom,
x = y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i) ).
thf(4,conjecture,
more @ ( pl @ x @ z ) @ ( pl @ y @ u ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19g) ).
thf(5,negated_conjecture,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
= $false ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [Xx: nat,Xy: nat,Xz: nat] :
( ( more @ Xx @ Xy )
=> ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( more @ z @ u )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( x = y )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(10,plain,
( ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
| ! [Xz: nat] : ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(12,plain,
( ( x = y )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
( ( more @ z @ u )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
| ! [Xz: nat] : ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(15,plain,
( ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
! [SV1: nat] :
( ( ! [SY3: nat] :
( ~ ( more @ SV1 @ SY3 )
| ! [SY4: nat] : ( more @ ( pl @ SY4 @ SV1 ) @ ( pl @ SY4 @ SY3 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(18,plain,
! [SV2: nat,SV1: nat] :
( ( ~ ( more @ SV1 @ SV2 )
| ! [SY5: nat] : ( more @ ( pl @ SY5 @ SV1 ) @ ( pl @ SY5 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV2: nat,SV1: nat] :
( ( ( ~ ( more @ SV1 @ SV2 ) )
= $true )
| ( ( ! [SY5: nat] : ( more @ ( pl @ SY5 @ SV1 ) @ ( pl @ SY5 @ SV2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(20,plain,
! [SV2: nat,SV1: nat] :
( ( ( more @ SV1 @ SV2 )
= $false )
| ( ( ! [SY5: nat] : ( more @ ( pl @ SY5 @ SV1 ) @ ( pl @ SY5 @ SV2 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(21,plain,
! [SV2: nat,SV1: nat,SV3: nat] :
( ( ( more @ ( pl @ SV3 @ SV1 ) @ ( pl @ SV3 @ SV2 ) )
= $true )
| ( ( more @ SV1 @ SV2 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(22,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,21,17,13]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM676^1 : TPTP v8.1.0. Released v3.7.0.
% 0.10/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 00:14:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 3
% 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:3,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:5,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 23 ****
% 0.12/0.37 %**** clause counter: 22 ****
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------