TSTP Solution File: SET046+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:54 EDT 2023
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 2 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 85 ( 35 ~; 29 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 40 ( 0 sgn; 20 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel42) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(flattening,[],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ! [X2] :
( ~ element(X2,X1)
| ~ element(X1,X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X2] :
( ~ element(X2,X1)
| ~ element(X1,X2) )
| ~ element(X1,X0) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,X0) ) )
=> ! [X1] :
( ( element(X1,sK0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X1] :
( ? [X2] :
( element(X2,X1)
& element(X1,X2) )
=> ( element(sK1(X1),X1)
& element(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X1] :
( ( element(X1,sK0)
| ( element(sK1(X1),X1)
& element(X1,sK1(X1)) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
! [X3,X1] :
( ~ element(X3,X1)
| ~ element(X1,X3)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X1] :
( element(X1,sK0)
| element(X1,sK1(X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X1] :
( element(X1,sK0)
| element(sK1(X1),X1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( element(sK1(X0),X0)
| element(X0,sK0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
( element(X0,sK1(X0))
| element(X0,sK0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
( ~ element(X0,X1)
| ~ element(X1,X0)
| ~ element(X0,sK0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_52,plain,
( element(sK0,sK1(sK0))
| element(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_53,plain,
( element(sK1(sK0),sK0)
| element(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_54,plain,
~ element(sK0,sK0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_69,plain,
( ~ element(sK1(sK0),X0)
| ~ element(X0,sK1(sK0))
| ~ element(sK1(sK0),sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_71,plain,
( ~ element(sK1(sK0),sK0)
| ~ element(sK0,sK1(sK0)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_72,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_71,c_54,c_53,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 08:41:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16 git: last_make_outside_of_git: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 3
% 0.48/1.16 conjectures 3
% 0.48/1.16 EPR 1
% 0.48/1.16 Horn 1
% 0.48/1.16 unary 0
% 0.48/1.16 binary 2
% 0.48/1.16 lits 7
% 0.48/1.16 lits eq 0
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ no equalities: superposition off
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------