TSTP Solution File: SET027+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET027+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:43 EDT 2023
% Result : Theorem 0.44s 1.15s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 99 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 104 ( 42 ~; 33 |; 21 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn; 33 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( subset(X1,X5)
& subset(X0,X1) )
=> subset(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI03) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( subset(X1,X5)
& subset(X0,X1) )
=> subset(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
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,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f28,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(f29,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,[],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,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])],[f29,f30]) ).
fof(f50,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ subset(sK3,sK5)
& subset(sK4,sK5)
& subset(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
( ~ subset(sK3,sK5)
& subset(sK4,sK5)
& subset(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f27,f50]) ).
fof(f52,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f78,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f51]) ).
fof(f79,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f51]) ).
fof(f80,plain,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f51]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_75,negated_conjecture,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f80]) ).
cnf(c_76,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f79]) ).
cnf(c_77,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f78]) ).
cnf(c_102,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
cnf(c_106,plain,
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_107,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_106]) ).
cnf(c_375,plain,
( X0 != sK3
| X1 != sK5
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_107,c_75]) ).
cnf(c_376,plain,
member(sK0(sK3,sK5),sK3),
inference(unflattening,[status(thm)],[c_375]) ).
cnf(c_380,plain,
( X0 != sK3
| X1 != sK5
| ~ member(sK0(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_102,c_75]) ).
cnf(c_381,plain,
~ member(sK0(sK3,sK5),sK5),
inference(unflattening,[status(thm)],[c_380]) ).
cnf(c_964,plain,
( ~ member(sK0(sK3,sK5),X0)
| ~ subset(X0,sK5)
| member(sK0(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1134,plain,
( ~ member(sK0(sK3,sK5),sK4)
| ~ subset(sK4,sK5)
| member(sK0(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_964]) ).
cnf(c_1270,plain,
( ~ member(sK0(sK3,sK5),X0)
| ~ subset(X0,sK4)
| member(sK0(sK3,sK5),sK4) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1271,plain,
( ~ member(sK0(sK3,sK5),sK3)
| ~ subset(sK3,sK4)
| member(sK0(sK3,sK5),sK4) ),
inference(instantiation,[status(thm)],[c_1270]) ).
cnf(c_1272,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1271,c_1134,c_381,c_376,c_76,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET027+4 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 11:22:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.44/1.15 % SZS status Started for theBenchmark.p
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.15
% 0.44/1.15 ------ iProver source info
% 0.44/1.15
% 0.44/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.15 git: non_committed_changes: false
% 0.44/1.15 git: last_make_outside_of_git: false
% 0.44/1.15
% 0.44/1.15 ------ Parsing...
% 0.44/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.15
% 0.44/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.44/1.15
% 0.44/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.15
% 0.44/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/1.15 ------ Proving...
% 0.44/1.15 ------ Problem Properties
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 clauses 29
% 0.44/1.15 conjectures 3
% 0.44/1.15 EPR 5
% 0.44/1.15 Horn 24
% 0.44/1.15 unary 7
% 0.44/1.15 binary 15
% 0.44/1.15 lits 58
% 0.44/1.15 lits eq 3
% 0.44/1.15 fd_pure 0
% 0.44/1.15 fd_pseudo 0
% 0.44/1.15 fd_cond 0
% 0.44/1.15 fd_pseudo_cond 2
% 0.44/1.15 AC symbols 0
% 0.44/1.15
% 0.44/1.15 ------ Input Options Time Limit: Unbounded
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 ------
% 0.44/1.15 Current options:
% 0.44/1.15 ------
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 ------ Proving...
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.15
% 0.44/1.15
%------------------------------------------------------------------------------