TSTP Solution File: SET095+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET095+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:06:26 EDT 2023
% Result : Theorem 2.98s 1.19s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 72 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 70 ( 27 ~; 20 |; 13 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn; 35 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f8,axiom,
! [X2,X0] :
( member(X2,singleton(X0))
<=> X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
fof(f12,conjecture,
! [X0,X2] :
( member(X2,X0)
=> subset(singleton(X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI44) ).
fof(f13,negated_conjecture,
~ ! [X0,X2] :
( member(X2,X0)
=> subset(singleton(X2),X0) ),
inference(negated_conjecture,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f23,plain,
~ ! [X0,X1] :
( member(X1,X0)
=> subset(singleton(X1),X0) ),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
? [X0,X1] :
( ~ subset(singleton(X1),X0)
& member(X1,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f28,f29]) ).
fof(f38,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f49,plain,
( ? [X0,X1] :
( ~ subset(singleton(X1),X0)
& member(X1,X0) )
=> ( ~ subset(singleton(sK4),sK3)
& member(sK4,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
( ~ subset(singleton(sK4),sK3)
& member(sK4,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f26,f49]) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f66,plain,
! [X0,X1] :
( X0 = X1
| ~ member(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f77,plain,
member(sK4,sK3),
inference(cnf_transformation,[],[f50]) ).
fof(f78,plain,
~ subset(singleton(sK4),sK3),
inference(cnf_transformation,[],[f50]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_65,plain,
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_75,negated_conjecture,
~ subset(singleton(sK4),sK3),
inference(cnf_transformation,[],[f78]) ).
cnf(c_76,negated_conjecture,
member(sK4,sK3),
inference(cnf_transformation,[],[f77]) ).
cnf(c_11428,plain,
( sK0(singleton(X0),X1) = X0
| subset(singleton(X0),X1) ),
inference(superposition,[status(thm)],[c_50,c_65]) ).
cnf(c_11444,plain,
sK0(singleton(sK4),sK3) = sK4,
inference(superposition,[status(thm)],[c_11428,c_75]) ).
cnf(c_11517,plain,
( ~ member(sK4,sK3)
| subset(singleton(sK4),sK3) ),
inference(superposition,[status(thm)],[c_11444,c_49]) ).
cnf(c_11519,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11517,c_75,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET095+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.18/0.35 % Computer : n022.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Sat Aug 26 14:29:40 EDT 2023
% 0.18/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.98/1.19 % SZS status Started for theBenchmark.p
% 2.98/1.19 % SZS status Theorem for theBenchmark.p
% 2.98/1.19
% 2.98/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.98/1.19
% 2.98/1.19 ------ iProver source info
% 2.98/1.19
% 2.98/1.19 git: date: 2023-05-31 18:12:56 +0000
% 2.98/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.98/1.19 git: non_committed_changes: false
% 2.98/1.19 git: last_make_outside_of_git: false
% 2.98/1.19
% 2.98/1.19 ------ Parsing...
% 2.98/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.98/1.19
% 2.98/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.98/1.19
% 2.98/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.98/1.19
% 2.98/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.98/1.19 ------ Proving...
% 2.98/1.19 ------ Problem Properties
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19 clauses 28
% 2.98/1.19 conjectures 2
% 2.98/1.19 EPR 3
% 2.98/1.19 Horn 23
% 2.98/1.19 unary 6
% 2.98/1.19 binary 15
% 2.98/1.19 lits 57
% 2.98/1.19 lits eq 3
% 2.98/1.19 fd_pure 0
% 2.98/1.19 fd_pseudo 0
% 2.98/1.19 fd_cond 0
% 2.98/1.19 fd_pseudo_cond 2
% 2.98/1.19 AC symbols 0
% 2.98/1.19
% 2.98/1.19 ------ Schedule dynamic 5 is on
% 2.98/1.19
% 2.98/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19 ------
% 2.98/1.19 Current options:
% 2.98/1.19 ------
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19 ------ Proving...
% 2.98/1.19
% 2.98/1.19
% 2.98/1.19 % SZS status Theorem for theBenchmark.p
% 2.98/1.19
% 2.98/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.98/1.19
% 2.98/1.19
%------------------------------------------------------------------------------