TSTP Solution File: SET584+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET584+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:08:24 EDT 2023
% Result : Theorem 3.28s 1.10s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 103 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 48 ~; 39 |; 16 &)
% ( 3 <=>; 5 =>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 2 sgn; 48 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(union(X0,X2),union(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th33) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(union(X0,X2),union(X1,X2)) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ subset(union(X0,X2),union(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[f8]) ).
fof(f13,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,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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])],[f13,f14]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( ~ subset(union(X0,X2),union(X1,X2))
& subset(X0,X1) )
=> ( ~ subset(union(sK2,sK4),union(sK3,sK4))
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ~ subset(union(sK2,sK4),union(sK3,sK4))
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f9,f20]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f34,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
~ subset(union(sK2,sK4),union(sK3,sK4)),
inference(cnf_transformation,[],[f21]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_53,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_59,negated_conjecture,
~ subset(union(sK2,sK4),union(sK3,sK4)),
inference(cnf_transformation,[],[f35]) ).
cnf(c_60,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
cnf(c_154,plain,
( union(sK2,sK4) != X0
| union(sK3,sK4) != X1
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_53,c_59]) ).
cnf(c_155,plain,
member(sK0(union(sK2,sK4),union(sK3,sK4)),union(sK2,sK4)),
inference(unflattening,[status(thm)],[c_154]) ).
cnf(c_366,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK4)),union(sK3,sK4)),
inference(resolution,[status(thm)],[c_52,c_59]) ).
cnf(c_368,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK4)),sK3),
inference(resolution,[status(thm)],[c_366,c_50]) ).
cnf(c_369,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK4)),sK4),
inference(resolution,[status(thm)],[c_366,c_49]) ).
cnf(c_381,plain,
( ~ member(sK0(union(sK2,sK4),union(sK3,sK4)),union(X0,sK4))
| member(sK0(union(sK2,sK4),union(sK3,sK4)),X0) ),
inference(resolution,[status(thm)],[c_51,c_369]) ).
cnf(c_382,plain,
( ~ member(sK0(union(sK2,sK4),union(sK3,sK4)),union(sK2,sK4))
| member(sK0(union(sK2,sK4),union(sK3,sK4)),sK2) ),
inference(instantiation,[status(thm)],[c_381]) ).
cnf(c_705,plain,
( ~ member(sK0(union(sK2,sK4),union(sK3,sK4)),X0)
| ~ subset(X0,sK3) ),
inference(resolution,[status(thm)],[c_54,c_368]) ).
cnf(c_706,plain,
( ~ member(sK0(union(sK2,sK4),union(sK3,sK4)),sK2)
| ~ subset(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_705]) ).
cnf(c_707,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_706,c_382,c_155,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET584+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n016.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sat Aug 26 10:53:42 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.28/1.10 % SZS status Started for theBenchmark.p
% 3.28/1.10 % SZS status Theorem for theBenchmark.p
% 3.28/1.10
% 3.28/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.28/1.10
% 3.28/1.10 ------ iProver source info
% 3.28/1.10
% 3.28/1.10 git: date: 2023-05-31 18:12:56 +0000
% 3.28/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.28/1.10 git: non_committed_changes: false
% 3.28/1.10 git: last_make_outside_of_git: false
% 3.28/1.10
% 3.28/1.10 ------ Parsing...
% 3.28/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.28/1.10
% 3.28/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.28/1.10
% 3.28/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.28/1.10
% 3.28/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.10 ------ Proving...
% 3.28/1.10 ------ Problem Properties
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10 clauses 12
% 3.28/1.10 conjectures 2
% 3.28/1.10 EPR 3
% 3.28/1.10 Horn 9
% 3.28/1.10 unary 4
% 3.28/1.10 binary 4
% 3.28/1.10 lits 24
% 3.28/1.10 lits eq 3
% 3.28/1.10 fd_pure 0
% 3.28/1.10 fd_pseudo 0
% 3.28/1.10 fd_cond 0
% 3.28/1.10 fd_pseudo_cond 2
% 3.28/1.10 AC symbols 0
% 3.28/1.10
% 3.28/1.10 ------ Input Options Time Limit: Unbounded
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10 ------
% 3.28/1.10 Current options:
% 3.28/1.10 ------
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10 ------ Proving...
% 3.28/1.10
% 3.28/1.10
% 3.28/1.10 % SZS status Theorem for theBenchmark.p
% 3.28/1.10
% 3.28/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.10
% 3.28/1.10
%------------------------------------------------------------------------------