TSTP Solution File: SEU089+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 : Thu Aug 31 17:03:40 EDT 2023
% Result : Theorem 2.10s 1.18s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 60 ( 2 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 10 |; 20 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn; 20 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_zfmisc_1) ).
fof(f51,axiom,
! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(cartesian_product2(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_finset_1) ).
fof(f53,conjecture,
! [X0,X1,X2] :
( ( finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product3(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_finset_1) ).
fof(f54,negated_conjecture,
~ ! [X0,X1,X2] :
( ( finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product3(X0,X1,X2)) ),
inference(negated_conjecture,[],[f53]) ).
fof(f109,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f110,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(flattening,[],[f109]) ).
fof(f112,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f113,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(flattening,[],[f112]) ).
fof(f175,plain,
( ? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) )
=> ( ~ finite(cartesian_product3(sK26,sK27,sK28))
& finite(sK28)
& finite(sK27)
& finite(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( ~ finite(cartesian_product3(sK26,sK27,sK28))
& finite(sK28)
& finite(sK27)
& finite(sK26) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28])],[f113,f175]) ).
fof(f200,plain,
! [X2,X0,X1] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
inference(cnf_transformation,[],[f14]) ).
fof(f290,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f292,plain,
finite(sK26),
inference(cnf_transformation,[],[f176]) ).
fof(f293,plain,
finite(sK27),
inference(cnf_transformation,[],[f176]) ).
fof(f294,plain,
finite(sK28),
inference(cnf_transformation,[],[f176]) ).
fof(f295,plain,
~ finite(cartesian_product3(sK26,sK27,sK28)),
inference(cnf_transformation,[],[f176]) ).
fof(f304,plain,
~ finite(cartesian_product2(cartesian_product2(sK26,sK27),sK28)),
inference(definition_unfolding,[],[f295,f200]) ).
cnf(c_157,plain,
( ~ finite(X0)
| ~ finite(X1)
| finite(cartesian_product2(X1,X0)) ),
inference(cnf_transformation,[],[f290]) ).
cnf(c_159,negated_conjecture,
~ finite(cartesian_product2(cartesian_product2(sK26,sK27),sK28)),
inference(cnf_transformation,[],[f304]) ).
cnf(c_160,negated_conjecture,
finite(sK28),
inference(cnf_transformation,[],[f294]) ).
cnf(c_161,negated_conjecture,
finite(sK27),
inference(cnf_transformation,[],[f293]) ).
cnf(c_162,negated_conjecture,
finite(sK26),
inference(cnf_transformation,[],[f292]) ).
cnf(c_1433,plain,
( ~ finite(cartesian_product2(sK26,sK27))
| ~ finite(sK28) ),
inference(superposition,[status(thm)],[c_157,c_159]) ).
cnf(c_1434,plain,
~ finite(cartesian_product2(sK26,sK27)),
inference(forward_subsumption_resolution,[status(thm)],[c_1433,c_160]) ).
cnf(c_1490,plain,
( ~ finite(sK26)
| ~ finite(sK27) ),
inference(superposition,[status(thm)],[c_157,c_1434]) ).
cnf(c_1491,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1490,c_161,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n026.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 : Wed Aug 23 14:42:46 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.10/1.18 % SZS status Started for theBenchmark.p
% 2.10/1.18 % SZS status Theorem for theBenchmark.p
% 2.10/1.18
% 2.10/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.10/1.18
% 2.10/1.18 ------ iProver source info
% 2.10/1.18
% 2.10/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.10/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.10/1.18 git: non_committed_changes: false
% 2.10/1.18 git: last_make_outside_of_git: false
% 2.10/1.18
% 2.10/1.18 ------ Parsing...
% 2.10/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.10/1.18
% 2.10/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 70 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 2.10/1.18
% 2.10/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.10/1.18
% 2.10/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.10/1.18 ------ Proving...
% 2.10/1.18 ------ Problem Properties
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18 clauses 46
% 2.10/1.18 conjectures 4
% 2.10/1.18 EPR 26
% 2.10/1.18 Horn 40
% 2.10/1.18 unary 28
% 2.10/1.18 binary 10
% 2.10/1.18 lits 73
% 2.10/1.18 lits eq 2
% 2.10/1.18 fd_pure 0
% 2.10/1.18 fd_pseudo 0
% 2.10/1.18 fd_cond 1
% 2.10/1.18 fd_pseudo_cond 1
% 2.10/1.18 AC symbols 0
% 2.10/1.18
% 2.10/1.18 ------ Schedule dynamic 5 is on
% 2.10/1.18
% 2.10/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18 ------
% 2.10/1.18 Current options:
% 2.10/1.18 ------
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18 ------ Proving...
% 2.10/1.18
% 2.10/1.18
% 2.10/1.18 % SZS status Theorem for theBenchmark.p
% 2.10/1.18
% 2.10/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.10/1.18
% 2.10/1.18
%------------------------------------------------------------------------------