TSTP Solution File: SET045+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET045+1 : TPTP v8.1.2. Released v2.0.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 15:05:53 EDT 2023
% Result : Theorem 1.68s 1.11s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 24 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 41 ( 3 sgn; 23 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
( element(X2,X1)
<=> ( ~ element(X2,X2)
& element(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41_1) ).
fof(f2,conjecture,
~ ? [X0] :
! [X2] : element(X2,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
! [X2] : element(X2,X0),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
! [X1] : element(X1,X0),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
! [X1] : element(X1,X0),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) )
=> ! [X2] :
( ( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X2] :
( ( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,sK0(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
fof(f10,plain,
( ? [X0] :
! [X1] : element(X1,X0)
=> ! [X1] : element(X1,sK1) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X1] : element(X1,sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f5,f10]) ).
fof(f13,plain,
! [X2,X0] :
( ~ element(X2,X2)
| ~ element(X2,sK0(X0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X2,X0] :
( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X1] : element(X1,sK1),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,plain,
( ~ element(X0,X1)
| element(X0,sK0(X1))
| element(X0,X0) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,plain,
( ~ element(X0,sK0(X1))
| ~ element(X0,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
element(X0,sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_73,plain,
( ~ element(sK0(X0),X1)
| element(sK0(X0),sK0(X0))
| element(sK0(X0),sK0(X1)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_74,plain,
~ element(sK0(X0),sK0(X0)),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_75,plain,
( ~ element(sK0(sK1),sK1)
| element(sK0(sK1),sK0(sK1)) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_76,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_85,plain,
element(sK0(X0),sK1),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_86,plain,
element(sK0(sK1),sK1),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_87,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_86,c_76,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET045+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat Aug 26 10:34:08 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.42 Running first-order theorem proving
% 0.18/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.68/1.11 % SZS status Started for theBenchmark.p
% 1.68/1.11 % SZS status Theorem for theBenchmark.p
% 1.68/1.11
% 1.68/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.68/1.11
% 1.68/1.11 ------ iProver source info
% 1.68/1.11
% 1.68/1.11 git: date: 2023-05-31 18:12:56 +0000
% 1.68/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.68/1.11 git: non_committed_changes: false
% 1.68/1.11 git: last_make_outside_of_git: false
% 1.68/1.11
% 1.68/1.11 ------ Parsing...
% 1.68/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.68/1.11
% 1.68/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.68/1.11
% 1.68/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.68/1.11 ------ Proving...
% 1.68/1.11 ------ Problem Properties
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11 clauses 4
% 1.68/1.11 conjectures 1
% 1.68/1.11 EPR 1
% 1.68/1.11 Horn 3
% 1.68/1.11 unary 1
% 1.68/1.11 binary 2
% 1.68/1.11 lits 8
% 1.68/1.11 lits eq 0
% 1.68/1.11 fd_pure 0
% 1.68/1.11 fd_pseudo 0
% 1.68/1.11 fd_cond 0
% 1.68/1.11 fd_pseudo_cond 0
% 1.68/1.11 AC symbols 0
% 1.68/1.11
% 1.68/1.11 ------ Schedule dynamic 5 is on
% 1.68/1.11
% 1.68/1.11 ------ no equalities: superposition off
% 1.68/1.11
% 1.68/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11 ------
% 1.68/1.11 Current options:
% 1.68/1.11 ------
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11 ------ Proving...
% 1.68/1.11
% 1.68/1.11
% 1.68/1.11 % SZS status Theorem for theBenchmark.p
% 1.68/1.11
% 1.68/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.68/1.11
% 1.68/1.11
%------------------------------------------------------------------------------