TSTP Solution File: SET941+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET941+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:10:45 EDT 2023
% Result : Theorem 2.61s 1.16s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 4 unt; 0 def)
% Number of atoms : 157 ( 9 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 187 ( 70 ~; 67 |; 36 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn; 71 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f7,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t94_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f12,plain,
? [X0,X1] :
( ~ subset(union(X0),X1)
& ! [X2] :
( subset(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
| in(sK1(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
=> ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f18,f21,f20,f19]) ).
fof(f27,plain,
( ? [X0,X1] :
( ~ subset(union(X0),X1)
& ! [X2] :
( subset(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ subset(union(sK6),sK7)
& ! [X2] :
( subset(X2,sK7)
| ~ in(X2,sK6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( ~ subset(union(sK6),sK7)
& ! [X2] :
( subset(X2,sK7)
| ~ in(X2,sK6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f12,f27]) ).
fof(f30,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f33,plain,
! [X0,X1,X5] :
( in(X5,sK3(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
! [X0,X1,X5] :
( in(sK3(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X2] :
( subset(X2,sK7)
| ~ in(X2,sK6) ),
inference(cnf_transformation,[],[f28]) ).
fof(f43,plain,
~ subset(union(sK6),sK7),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X0,X5] :
( in(sK3(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f34]) ).
fof(f46,plain,
! [X0,X5] :
( in(X5,sK3(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f33]) ).
cnf(c_50,plain,
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_51,plain,
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_57,plain,
( ~ in(X0,union(X1))
| in(sK3(X1,X0),X1) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_58,plain,
( ~ in(X0,union(X1))
| in(X0,sK3(X1,X0)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_62,negated_conjecture,
~ subset(union(sK6),sK7),
inference(cnf_transformation,[],[f43]) ).
cnf(c_63,negated_conjecture,
( ~ in(X0,sK6)
| subset(X0,sK7) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_684,plain,
( ~ in(X0,union(sK6))
| subset(sK3(sK6,X0),sK7) ),
inference(superposition,[status(thm)],[c_57,c_63]) ).
cnf(c_707,plain,
( ~ subset(sK3(X0,X1),X2)
| ~ in(X1,union(X0))
| in(X1,X2) ),
inference(superposition,[status(thm)],[c_58,c_52]) ).
cnf(c_913,plain,
( ~ in(X0,union(sK6))
| in(X0,sK7) ),
inference(superposition,[status(thm)],[c_684,c_707]) ).
cnf(c_1054,plain,
( in(sK0(union(sK6),X0),sK7)
| subset(union(sK6),X0) ),
inference(superposition,[status(thm)],[c_51,c_913]) ).
cnf(c_1167,plain,
subset(union(sK6),sK7),
inference(superposition,[status(thm)],[c_1054,c_50]) ).
cnf(c_1168,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1167,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET941+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 08:53:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.61/1.16 % SZS status Started for theBenchmark.p
% 2.61/1.16 % SZS status Theorem for theBenchmark.p
% 2.61/1.16
% 2.61/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.61/1.16
% 2.61/1.16 ------ iProver source info
% 2.61/1.16
% 2.61/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.61/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.61/1.16 git: non_committed_changes: false
% 2.61/1.16 git: last_make_outside_of_git: false
% 2.61/1.16
% 2.61/1.16 ------ Parsing...
% 2.61/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.61/1.16
% 2.61/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 2.61/1.16
% 2.61/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.61/1.16
% 2.61/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.61/1.16 ------ Proving...
% 2.61/1.16 ------ Problem Properties
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16 clauses 14
% 2.61/1.16 conjectures 2
% 2.61/1.16 EPR 5
% 2.61/1.16 Horn 11
% 2.61/1.16 unary 3
% 2.61/1.16 binary 6
% 2.61/1.16 lits 31
% 2.61/1.16 lits eq 4
% 2.61/1.16 fd_pure 0
% 2.61/1.16 fd_pseudo 0
% 2.61/1.16 fd_cond 0
% 2.61/1.16 fd_pseudo_cond 3
% 2.61/1.16 AC symbols 0
% 2.61/1.16
% 2.61/1.16 ------ Schedule dynamic 5 is on
% 2.61/1.16
% 2.61/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16 ------
% 2.61/1.16 Current options:
% 2.61/1.16 ------
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16 ------ Proving...
% 2.61/1.16
% 2.61/1.16
% 2.61/1.16 % SZS status Theorem for theBenchmark.p
% 2.61/1.16
% 2.61/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.61/1.16
% 2.61/1.16
%------------------------------------------------------------------------------