TSTP Solution File: SEU143+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:02 EDT 2023
% Result : Theorem 1.28s 0.98s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 78 ( 43 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 88 ( 36 ~; 32 |; 14 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn; 34 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f7,conjecture,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0] : singleton(X0) != empty_set,
inference(negated_conjecture,[],[f7]) ).
fof(f12,plain,
? [X0] : singleton(X0) = empty_set,
inference(ennf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f17,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0] :
( ( empty_set = X0
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f18,f19]) ).
fof(f21,plain,
( ? [X0] : singleton(X0) = empty_set
=> empty_set = singleton(sK2) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
empty_set = singleton(sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f12,f21]) ).
fof(f29,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
empty_set = singleton(sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f29]) ).
fof(f39,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f38]) ).
fof(f41,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f32]) ).
cnf(c_52,plain,
in(X0,singleton(X0)),
inference(cnf_transformation,[],[f39]) ).
cnf(c_55,plain,
~ in(X0,empty_set),
inference(cnf_transformation,[],[f41]) ).
cnf(c_57,negated_conjecture,
singleton(sK2) = empty_set,
inference(cnf_transformation,[],[f35]) ).
cnf(c_275,plain,
in(sK2,empty_set),
inference(superposition,[status(thm)],[c_57,c_52]) ).
cnf(c_276,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_275,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Wed Aug 23 23:38:11 EDT 2023
% 0.09/0.27 % CPUTime :
% 0.11/0.35 Running first-order theorem proving
% 0.11/0.35 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.28/0.98 % SZS status Started for theBenchmark.p
% 1.28/0.98 % SZS status Theorem for theBenchmark.p
% 1.28/0.98
% 1.28/0.98 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.28/0.98
% 1.28/0.98 ------ iProver source info
% 1.28/0.98
% 1.28/0.98 git: date: 2023-05-31 18:12:56 +0000
% 1.28/0.98 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.28/0.98 git: non_committed_changes: false
% 1.28/0.98 git: last_make_outside_of_git: false
% 1.28/0.98
% 1.28/0.98 ------ Parsing...
% 1.28/0.98 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.28/0.98
% 1.28/0.98 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.28/0.98
% 1.28/0.98 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.28/0.98
% 1.28/0.98 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.28/0.98 ------ Proving...
% 1.28/0.98 ------ Problem Properties
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98 clauses 11
% 1.28/0.98 conjectures 1
% 1.28/0.98 EPR 5
% 1.28/0.98 Horn 9
% 1.28/0.98 unary 6
% 1.28/0.98 binary 3
% 1.28/0.98 lits 18
% 1.28/0.98 lits eq 7
% 1.28/0.98 fd_pure 0
% 1.28/0.98 fd_pseudo 0
% 1.28/0.98 fd_cond 1
% 1.28/0.98 fd_pseudo_cond 2
% 1.28/0.98 AC symbols 0
% 1.28/0.98
% 1.28/0.98 ------ Schedule dynamic 5 is on
% 1.28/0.98
% 1.28/0.98 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98 ------
% 1.28/0.98 Current options:
% 1.28/0.98 ------
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98 ------ Proving...
% 1.28/0.98
% 1.28/0.98
% 1.28/0.98 % SZS status Theorem for theBenchmark.p
% 1.28/0.98
% 1.28/0.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.28/0.98
% 1.28/0.98
%------------------------------------------------------------------------------