TSTP Solution File: ITP340_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP001_1 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:41 EDT 2024
% Result : Theorem 11.54s 2.19s
% Output : CNFRefutation 11.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 240 ( 20 equ)
% Maximal formula atoms : 3 ( 8 avg)
% Number of connectives : 36 ( 20 ~; 11 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 197 ( 197 fml; 0 var)
% Number arithmetic : 15 ( 15 atm; 0 fun; 0 num; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 22 ( 17 usr; 8 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 19 ( 0 sgn 13 !; 3 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(f6,conjecture,
? [X0: 'Cols$'] :
( $lesseq('fun_app$d'('of_nat$','rank$'('a$')),'fun_app$d'('of_nat$','to_nat$'(X0)))
& ( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) = 'row$'(X0,'p_Gauss_Jordan$'('transpose$'('a$'))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture5) ).
tff(f7,negated_conjecture,
~ ? [X0: 'Cols$'] :
( $lesseq('fun_app$d'('of_nat$','rank$'('a$')),'fun_app$d'('of_nat$','to_nat$'(X0)))
& ( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) = 'row$'(X0,'p_Gauss_Jordan$'('transpose$'('a$'))) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f10,axiom,
$lesseq('fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'('a$'))),'fun_app$d'('of_nat$','i$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom8) ).
tff(f380,axiom,
! [X0: 'A_cols_vec_rows_vec$'] : ( 'fun_app$d'('of_nat$','rank$'(X0)) = 'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom378) ).
tff(f433,axiom,
$less('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','card$'('top$'))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom431) ).
tff(f449,axiom,
! [X0: 'Nat$',X1: 'Cols$'] :
( ( $less('fun_app$d'('of_nat$',X0),'fun_app$d'('of_nat$','card$'('top$')))
& ( 'fun_app$d'('of_nat$','to_nat$'(X1)) != 'fun_app$d'('of_nat$',X0) ) )
=> ( 'from_nat$'(X0) != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom447) ).
tff(f623,plain,
~ ? [X0: 'Cols$'] :
( ~ $less('fun_app$d'('of_nat$','to_nat$'(X0)),'fun_app$d'('of_nat$','rank$'('a$')))
& ( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) = 'row$'(X0,'p_Gauss_Jordan$'('transpose$'('a$'))) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f624,plain,
~ $less('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'('a$')))),
inference(theory_normalization,[],[f10]) ).
tff(f1021,plain,
! [X0: 'Cols$'] :
( $less('fun_app$d'('of_nat$','to_nat$'(X0)),'fun_app$d'('of_nat$','rank$'('a$')))
| ( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) != 'row$'(X0,'p_Gauss_Jordan$'('transpose$'('a$'))) ) ),
inference(ennf_transformation,[],[f623]) ).
tff(f1494,plain,
! [X0: 'Nat$',X1: 'Cols$'] :
( ( 'from_nat$'(X0) != X1 )
| ~ $less('fun_app$d'('of_nat$',X0),'fun_app$d'('of_nat$','card$'('top$')))
| ( 'fun_app$d'('of_nat$','to_nat$'(X1)) = 'fun_app$d'('of_nat$',X0) ) ),
inference(ennf_transformation,[],[f449]) ).
tff(f1495,plain,
! [X0: 'Nat$',X1: 'Cols$'] :
( ( 'from_nat$'(X0) != X1 )
| ~ $less('fun_app$d'('of_nat$',X0),'fun_app$d'('of_nat$','card$'('top$')))
| ( 'fun_app$d'('of_nat$','to_nat$'(X1)) = 'fun_app$d'('of_nat$',X0) ) ),
inference(flattening,[],[f1494]) ).
tff(f2160,plain,
! [X0: 'Cols$'] :
( $less('fun_app$d'('of_nat$','to_nat$'(X0)),'fun_app$d'('of_nat$','rank$'('a$')))
| ( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) != 'row$'(X0,'p_Gauss_Jordan$'('transpose$'('a$'))) ) ),
inference(cnf_transformation,[],[f1021]) ).
tff(f2163,plain,
~ $less('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'('a$')))),
inference(cnf_transformation,[],[f624]) ).
tff(f2765,plain,
! [X0: 'A_cols_vec_rows_vec$'] : ( 'fun_app$d'('of_nat$','rank$'(X0)) = 'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'(X0))) ),
inference(cnf_transformation,[],[f380]) ).
tff(f2851,plain,
$less('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','card$'('top$'))),
inference(cnf_transformation,[],[f433]) ).
tff(f2869,plain,
! [X0: 'Nat$',X1: 'Cols$'] :
( ( 'from_nat$'(X0) != X1 )
| ~ $less('fun_app$d'('of_nat$',X0),'fun_app$d'('of_nat$','card$'('top$')))
| ( 'fun_app$d'('of_nat$','to_nat$'(X1)) = 'fun_app$d'('of_nat$',X0) ) ),
inference(cnf_transformation,[],[f1495]) ).
tff(f3361,plain,
! [X0: 'Nat$'] :
( ~ $less('fun_app$d'('of_nat$',X0),'fun_app$d'('of_nat$','card$'('top$')))
| ( 'fun_app$d'('of_nat$',X0) = 'fun_app$d'('of_nat$','to_nat$'('from_nat$'(X0))) ) ),
inference(equality_resolution,[],[f2869]) ).
cnf(c_83,negated_conjecture,
( 'row$'('from_nat$'('i$'),'p_Gauss_Jordan$'('transpose$'('a$'))) != 'row$'(X0_50,'p_Gauss_Jordan$'('transpose$'('a$')))
| $less_int('fun_app$d'('of_nat$','to_nat$'(X0_50)),'fun_app$d'('of_nat$','rank$'('a$'))) ),
inference(cnf_transformation,[],[f2160]) ).
cnf(c_86,negated_conjecture,
~ $less_int('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'('a$')))),
inference(cnf_transformation,[],[f2163]) ).
cnf(c_629,plain,
'fun_app$d'('of_nat$','rank_iarray$'('matrix_to_iarray$'(X0_40))) = 'fun_app$d'('of_nat$','rank$'(X0_40)),
inference(cnf_transformation,[],[f2765]) ).
cnf(c_706,plain,
$less_int('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','card$'('top$'))),
inference(cnf_transformation,[],[f2851]) ).
cnf(c_724,plain,
( ~ $less_int('fun_app$d'('of_nat$',X0_31),'fun_app$d'('of_nat$','card$'('top$')))
| 'fun_app$d'('of_nat$','to_nat$'('from_nat$'(X0_31))) = 'fun_app$d'('of_nat$',X0_31) ),
inference(cnf_transformation,[],[f3361]) ).
cnf(c_6408,plain,
~ $less_int('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','rank$'('a$'))),
inference(demodulation,[status(thm)],[c_86,c_629]) ).
cnf(c_35493,plain,
$less_int('fun_app$d'('of_nat$','to_nat$'('from_nat$'('i$'))),'fun_app$d'('of_nat$','rank$'('a$'))),
inference(equality_resolution,[status(thm)],[c_83]) ).
cnf(c_38826,plain,
'fun_app$d'('of_nat$','to_nat$'('from_nat$'('i$'))) = 'fun_app$d'('of_nat$','i$'),
inference(superposition,[status(thm)],[c_706,c_724]) ).
cnf(c_38907,plain,
$less_int('fun_app$d'('of_nat$','i$'),'fun_app$d'('of_nat$','rank$'('a$'))),
inference(demodulation,[status(thm)],[c_35493,c_38826]) ).
cnf(c_38908,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_38907,c_6408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ITP001_1 : TPTP v8.1.2. Released v8.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:44:16 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running TFA theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.54/2.19 % SZS status Started for theBenchmark.p
% 11.54/2.19 % SZS status Theorem for theBenchmark.p
% 11.54/2.19
% 11.54/2.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 11.54/2.19
% 11.54/2.19 ------ iProver source info
% 11.54/2.19
% 11.54/2.19 git: date: 2024-05-02 19:28:25 +0000
% 11.54/2.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 11.54/2.19 git: non_committed_changes: false
% 11.54/2.19
% 11.54/2.19 ------ Parsing...
% 11.54/2.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 11.54/2.19
% 11.54/2.19 ------ Preprocessing... sup_sim: 49 sf_s rm: 19 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 3 sf_s rm: 19 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 19 0s sf_e pe_s pe_e
% 11.54/2.19
% 11.54/2.19 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.54/2.19
% 11.54/2.19 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 11.54/2.19 ------ Proving...
% 11.54/2.19 ------ Problem Properties
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19 clauses 518
% 11.54/2.19 conjectures 28
% 11.54/2.19 EPR 24
% 11.54/2.19 Horn 277
% 11.54/2.19 unary 79
% 11.54/2.19 binary 107
% 11.54/2.19 lits 1477
% 11.54/2.19 lits eq 129
% 11.54/2.19 fd_pure 1
% 11.54/2.19 fd_pseudo 0
% 11.54/2.19 fd_cond 4
% 11.54/2.19 fd_pseudo_cond 14
% 11.54/2.19 AC symbols 2
% 11.54/2.19
% 11.54/2.19 ------ Input Options Time Limit: Unbounded
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19 ------
% 11.54/2.19 Current options:
% 11.54/2.19 ------
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19 ------ Proving...
% 11.54/2.19
% 11.54/2.19
% 11.54/2.19 % SZS status Theorem for theBenchmark.p
% 11.54/2.19
% 11.54/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.54/2.19
% 11.54/2.19
%------------------------------------------------------------------------------