TSTP Solution File: SEU161+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU161+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:04:14 EDT 2023
% Result : Theorem 1.60s 1.19s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 26 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 10 ~; 3 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,conjecture,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t46_zfmisc_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,axiom,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f11,plain,
? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f12,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f13,plain,
( ? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) )
=> ( sK1 != set_union2(singleton(sK0),sK1)
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( sK1 != set_union2(singleton(sK0),sK1)
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f13]) ).
fof(f18,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
sK1 != set_union2(singleton(sK0),sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_52,negated_conjecture,
set_union2(singleton(sK0),sK1) != sK1,
inference(cnf_transformation,[],[f19]) ).
cnf(c_53,negated_conjecture,
in(sK0,sK1),
inference(cnf_transformation,[],[f18]) ).
cnf(c_54,plain,
( ~ in(X0,X1)
| set_union2(singleton(X0),X1) = X1 ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_189,plain,
set_union2(singleton(sK0),sK1) = sK1,
inference(superposition,[status(thm)],[c_53,c_54]) ).
cnf(c_190,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_189,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU161+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n005.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 16:32:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.60/1.19 % SZS status Started for theBenchmark.p
% 1.60/1.19 % SZS status Theorem for theBenchmark.p
% 1.60/1.19
% 1.60/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.60/1.19
% 1.60/1.19 ------ iProver source info
% 1.60/1.19
% 1.60/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.60/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.60/1.19 git: non_committed_changes: false
% 1.60/1.19 git: last_make_outside_of_git: false
% 1.60/1.19
% 1.60/1.19 ------ Parsing...
% 1.60/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.60/1.19
% 1.60/1.19 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.60/1.19
% 1.60/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.60/1.19
% 1.60/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.60/1.19 ------ Proving...
% 1.60/1.19 ------ Problem Properties
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19 clauses 6
% 1.60/1.19 conjectures 1
% 1.60/1.19 EPR 2
% 1.60/1.19 Horn 6
% 1.60/1.19 unary 4
% 1.60/1.19 binary 2
% 1.60/1.19 lits 8
% 1.60/1.19 lits eq 4
% 1.60/1.19 fd_pure 0
% 1.60/1.19 fd_pseudo 0
% 1.60/1.19 fd_cond 0
% 1.60/1.19 fd_pseudo_cond 0
% 1.60/1.19 AC symbols 0
% 1.60/1.19
% 1.60/1.19 ------ Schedule dynamic 5 is on
% 1.60/1.19
% 1.60/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19 ------
% 1.60/1.19 Current options:
% 1.60/1.19 ------
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19 ------ Proving...
% 1.60/1.19
% 1.60/1.19
% 1.60/1.19 % SZS status Theorem for theBenchmark.p
% 1.60/1.19
% 1.60/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.60/1.19
% 1.60/1.19
%------------------------------------------------------------------------------