TSTP Solution File: ITP367_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP367_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : 300s
% DateTime : Fri May 3 02:30:44 EDT 2024
% Result : Theorem 24.65s 4.12s
% Output : CNFRefutation 24.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 186 ( 0 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 73 ( 36 ~; 30 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 112 ( 112 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 11 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 31 ( 2 sgn 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(f3,conjecture,
'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture2) ).
tff(f4,negated_conjecture,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(negated_conjecture,[],[f3]) ).
tff(f66,axiom,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( ~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1))
<=> ( ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('finite$',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom64) ).
tff(f71,axiom,
'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom69) ).
tff(f72,axiom,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom70) ).
tff(f264,axiom,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( ( 'fun_app$a'('fun_app$g'('less_eq$',X1),X0)
& 'fun_app$a'('finite$',X0) )
=> 'fun_app$a'('finite$',X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom262) ).
tff(f289,axiom,
! [X0: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom287) ).
tff(f290,axiom,
! [X0: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom288) ).
tff(f642,plain,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(flattening,[],[f4]) ).
tff(f889,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('fun_app$g'('less_eq$',X1),X0)
| ~ 'fun_app$a'('finite$',X0) ),
inference(ennf_transformation,[],[f264]) ).
tff(f890,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('fun_app$g'('less_eq$',X1),X0)
| ~ 'fun_app$a'('finite$',X0) ),
inference(flattening,[],[f889]) ).
tff(f1208,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( ( ~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1))
| ( 'fun_app$a'('finite$',X1)
& 'fun_app$a'('finite$',X0) ) )
& ( ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('finite$',X0)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1)) ) ),
inference(nnf_transformation,[],[f66]) ).
tff(f1209,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( ( ~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1))
| ( 'fun_app$a'('finite$',X1)
& 'fun_app$a'('finite$',X0) ) )
& ( ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('finite$',X0)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1)) ) ),
inference(flattening,[],[f1208]) ).
tff(f1645,plain,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(cnf_transformation,[],[f642]) ).
tff(f1747,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('finite$',X0)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0),X1)) ),
inference(cnf_transformation,[],[f1209]) ).
tff(f1754,plain,
'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$')),
inference(cnf_transformation,[],[f71]) ).
tff(f1755,plain,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
inference(cnf_transformation,[],[f72]) ).
tff(f2049,plain,
! [X0: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('fun_app$g'('less_eq$',X1),X0)
| ~ 'fun_app$a'('finite$',X0) ),
inference(cnf_transformation,[],[f890]) ).
tff(f2080,plain,
! [X0: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X0)),
inference(cnf_transformation,[],[f289]) ).
tff(f2081,plain,
! [X0: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X0)),
inference(cnf_transformation,[],[f290]) ).
cnf(c_53,negated_conjecture,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(cnf_transformation,[],[f1645]) ).
cnf(c_157,plain,
( ~ 'fun_app$a'('finite$',X0_21)
| ~ 'fun_app$a'('finite$',X1_21)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X0_21),X1_21)) ),
inference(cnf_transformation,[],[f1747]) ).
cnf(c_162,plain,
'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$')),
inference(cnf_transformation,[],[f1754]) ).
cnf(c_163,plain,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
inference(cnf_transformation,[],[f1755]) ).
cnf(c_457,plain,
( ~ 'fun_app$a'('fun_app$g'('less_eq$',X0_21),X1_21)
| ~ 'fun_app$a'('finite$',X1_21)
| 'fun_app$a'('finite$',X0_21) ),
inference(cnf_transformation,[],[f2049]) ).
cnf(c_488,plain,
'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X0_23)),
inference(cnf_transformation,[],[f2080]) ).
cnf(c_489,plain,
'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X0_23)),
inference(cnf_transformation,[],[f2081]) ).
cnf(c_1119,plain,
'fun_app$a'('finite$','fun_app$h'('subformulas_nu$','phi$')),
inference(instantiation,[status(thm)],[c_489]) ).
cnf(c_1120,plain,
'fun_app$a'('finite$','fun_app$h'('subformulas_mu$','phi$')),
inference(instantiation,[status(thm)],[c_488]) ).
cnf(c_13643,plain,
( ~ 'fun_app$a'('fun_app$g'('less_eq$',X0_21),X1_21)
| ~ 'fun_app$a'('finite$',X1_21)
| 'fun_app$a'('finite$',X0_21) ),
inference(subtyping,[status(esa)],[c_457]) ).
cnf(c_13788,plain,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
inference(subtyping,[status(esa)],[c_163]) ).
cnf(c_13820,plain,
( ~ 'fun_app$a'('finite$',X0_21)
| ~ 'fun_app$a'('finite$',X1_21)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1_21),X0_21)) ),
inference(subtyping,[status(esa)],[c_157]) ).
cnf(c_24189,plain,
( ~ 'fun_app$a'('finite$','x$')
| ~ 'fun_app$a'('finite$','y$')
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')) ),
inference(instantiation,[status(thm)],[c_13820]) ).
cnf(c_24547,plain,
( ~ 'fun_app$a'('fun_app$g'('less_eq$','y$'),X0_21)
| ~ 'fun_app$a'('finite$',X0_21)
| 'fun_app$a'('finite$','y$') ),
inference(instantiation,[status(thm)],[c_13643]) ).
cnf(c_31390,plain,
( ~ 'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$'))
| ~ 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$','phi$'))
| 'fun_app$a'('finite$','y$') ),
inference(instantiation,[status(thm)],[c_24547]) ).
cnf(c_53194,plain,
( ~ 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$','phi$'))
| 'fun_app$a'('finite$','x$') ),
inference(superposition,[status(thm)],[c_13788,c_13643]) ).
cnf(c_53256,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_53194,c_31390,c_24189,c_53,c_162,c_1120,c_1119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : ITP367_1 : TPTP v8.1.2. Released v8.0.0.
% 0.02/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n013.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 21:45:19 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 24.65/4.12 % SZS status Started for theBenchmark.p
% 24.65/4.12 % SZS status Theorem for theBenchmark.p
% 24.65/4.12
% 24.65/4.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 24.65/4.12
% 24.65/4.12 ------ iProver source info
% 24.65/4.12
% 24.65/4.12 git: date: 2024-05-02 19:28:25 +0000
% 24.65/4.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 24.65/4.12 git: non_committed_changes: false
% 24.65/4.12
% 24.65/4.12 ------ Parsing...
% 24.65/4.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 24.65/4.12
% 24.65/4.12 ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 24.65/4.12
% 24.65/4.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 24.65/4.12
% 24.65/4.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 24.65/4.12 ------ Proving...
% 24.65/4.12 ------ Problem Properties
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12 clauses 625
% 24.65/4.12 conjectures 1
% 24.65/4.12 EPR 13
% 24.65/4.12 Horn 412
% 24.65/4.12 unary 122
% 24.65/4.12 binary 202
% 24.65/4.12 lits 1639
% 24.65/4.12 lits eq 348
% 24.65/4.12 fd_pure 0
% 24.65/4.12 fd_pseudo 0
% 24.65/4.12 fd_cond 62
% 24.65/4.12 fd_pseudo_cond 39
% 24.65/4.12 AC symbols 0
% 24.65/4.12
% 24.65/4.12 ------ Input Options Time Limit: Unbounded
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12 ------
% 24.65/4.12 Current options:
% 24.65/4.12 ------
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12 ------ Proving...
% 24.65/4.12
% 24.65/4.12
% 24.65/4.12 % SZS status Theorem for theBenchmark.p
% 24.65/4.12
% 24.65/4.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 24.65/4.12
% 24.65/4.12
%------------------------------------------------------------------------------