TSTP Solution File: SEU429+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:07:15 EDT 2023
% Result : Theorem 2.83s 1.21s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 74 ( 30 ~; 14 |; 20 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 44 ( 0 sgn; 24 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ~ v1_xboole_0(X0)
=> ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
=> ! [X3] :
( m2_relset_1(X3,X0,X1)
=> m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_relset_2) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ~ v1_xboole_0(X0)
=> ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
=> ! [X3] :
( m2_relset_1(X3,X0,X1)
=> m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f43,axiom,
! [X0,X1,X2,X3] :
( ( m2_relset_1(X3,X0,X1)
& m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
& ~ v1_xboole_0(X0) )
=> m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s8_domain_1__e1_38__relset_2) ).
fof(f61,plain,
? [X0] :
( ? [X1,X2] :
( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X3,X0,X1) )
& m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0))) )
& ~ v1_xboole_0(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f83,plain,
! [X0,X1,X2,X3] :
( m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X3,X0,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
| v1_xboole_0(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f84,plain,
! [X0,X1,X2,X3] :
( m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X3,X0,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
| v1_xboole_0(X0) ),
inference(flattening,[],[f83]) ).
fof(f96,plain,
( ? [X0] :
( ? [X1,X2] :
( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X3,X0,X1) )
& m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0))) )
& ~ v1_xboole_0(X0) )
=> ( ? [X2,X1] :
( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(sK0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X3,sK0,X1) )
& m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(sK0))) )
& ~ v1_xboole_0(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f97,plain,
( ? [X2,X1] :
( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(sK0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X3,sK0,X1) )
& m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(sK0))) )
=> ( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,X3),k1_zfmisc_1(k1_zfmisc_1(sK1)))
& m2_relset_1(X3,sK0,sK1) )
& m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(sK0))) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ? [X3] :
( ~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,X3),k1_zfmisc_1(k1_zfmisc_1(sK1)))
& m2_relset_1(X3,sK0,sK1) )
=> ( ~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,sK3),k1_zfmisc_1(k1_zfmisc_1(sK1)))
& m2_relset_1(sK3,sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
( ~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,sK3),k1_zfmisc_1(k1_zfmisc_1(sK1)))
& m2_relset_1(sK3,sK0,sK1)
& m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(sK0)))
& ~ v1_xboole_0(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f61,f98,f97,f96]) ).
fof(f128,plain,
~ v1_xboole_0(sK0),
inference(cnf_transformation,[],[f99]) ).
fof(f129,plain,
m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(sK0))),
inference(cnf_transformation,[],[f99]) ).
fof(f130,plain,
m2_relset_1(sK3,sK0,sK1),
inference(cnf_transformation,[],[f99]) ).
fof(f131,plain,
~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,sK3),k1_zfmisc_1(k1_zfmisc_1(sK1))),
inference(cnf_transformation,[],[f99]) ).
fof(f176,plain,
! [X2,X3,X0,X1] :
( m1_subset_1(a_4_1_relset_2(X0,X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X3,X0,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X0)))
| v1_xboole_0(X0) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_49,negated_conjecture,
~ m1_subset_1(a_4_1_relset_2(sK0,sK1,sK2,sK3),k1_zfmisc_1(k1_zfmisc_1(sK1))),
inference(cnf_transformation,[],[f131]) ).
cnf(c_50,negated_conjecture,
m2_relset_1(sK3,sK0,sK1),
inference(cnf_transformation,[],[f130]) ).
cnf(c_51,negated_conjecture,
m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(sK0))),
inference(cnf_transformation,[],[f129]) ).
cnf(c_52,negated_conjecture,
~ v1_xboole_0(sK0),
inference(cnf_transformation,[],[f128]) ).
cnf(c_97,plain,
( ~ m1_subset_1(X0,k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X2,X1,X3)
| m1_subset_1(a_4_1_relset_2(X1,X3,X0,X2),k1_zfmisc_1(k1_zfmisc_1(X3)))
| v1_xboole_0(X1) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_3438,plain,
( ~ m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(sK0)))
| ~ m2_relset_1(sK3,sK0,sK1)
| v1_xboole_0(sK0) ),
inference(superposition,[status(thm)],[c_97,c_49]) ).
cnf(c_3442,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3438,c_52,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 00:37:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.83/1.21 % SZS status Started for theBenchmark.p
% 2.83/1.21 % SZS status Theorem for theBenchmark.p
% 2.83/1.21
% 2.83/1.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.83/1.21
% 2.83/1.21 ------ iProver source info
% 2.83/1.21
% 2.83/1.21 git: date: 2023-05-31 18:12:56 +0000
% 2.83/1.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.83/1.21 git: non_committed_changes: false
% 2.83/1.21 git: last_make_outside_of_git: false
% 2.83/1.21
% 2.83/1.21 ------ Parsing...
% 2.83/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.83/1.21
% 2.83/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 11 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 2.83/1.21
% 2.83/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.83/1.21
% 2.83/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.83/1.21 ------ Proving...
% 2.83/1.21 ------ Problem Properties
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21 clauses 46
% 2.83/1.21 conjectures 4
% 2.83/1.21 EPR 11
% 2.83/1.21 Horn 37
% 2.83/1.21 unary 19
% 2.83/1.21 binary 12
% 2.83/1.21 lits 97
% 2.83/1.21 lits eq 9
% 2.83/1.21 fd_pure 0
% 2.83/1.21 fd_pseudo 0
% 2.83/1.21 fd_cond 1
% 2.83/1.21 fd_pseudo_cond 3
% 2.83/1.21 AC symbols 0
% 2.83/1.21
% 2.83/1.21 ------ Schedule dynamic 5 is on
% 2.83/1.21
% 2.83/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21 ------
% 2.83/1.21 Current options:
% 2.83/1.21 ------
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21 ------ Proving...
% 2.83/1.21
% 2.83/1.21
% 2.83/1.21 % SZS status Theorem for theBenchmark.p
% 2.83/1.21
% 2.83/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.83/1.21
% 2.83/1.21
%------------------------------------------------------------------------------