TSTP Solution File: SEU173+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU173+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 : Fri May 3 03:04:51 EDT 2024
% Result : Theorem 2.70s 1.15s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 6 unt; 0 def)
% Number of atoms : 161 ( 10 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 190 ( 75 ~; 68 |; 29 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 96 ( 1 sgn 65 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f3,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f11,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
inference(negated_conjecture,[],[f11]) ).
fof(f19,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f23,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f25,plain,
? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f30,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f31,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) )
& ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f35,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,[],[f24]) ).
fof(f36,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,[],[f35]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f36,f37]) ).
fof(f41,plain,
( ? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ element(sK3,powerset(sK4))
& ! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
( ~ element(sK3,powerset(sK4))
& ! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f25,f41]) ).
fof(f53,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f57,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f61,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f66,plain,
! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ),
inference(cnf_transformation,[],[f42]) ).
fof(f67,plain,
~ element(sK3,powerset(sK4)),
inference(cnf_transformation,[],[f42]) ).
fof(f76,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f78,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f53]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_56,plain,
( ~ in(X0,X1)
| element(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_58,plain,
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_59,plain,
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_64,negated_conjecture,
~ element(sK3,powerset(sK4)),
inference(cnf_transformation,[],[f67]) ).
cnf(c_65,negated_conjecture,
( ~ in(X0,sK3)
| in(X0,sK4) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_74,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_89,plain,
( element(X0,X1)
| ~ in(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_56,c_74,c_56]) ).
cnf(c_90,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(renaming,[status(thm)],[c_89]) ).
cnf(c_97,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_90]) ).
cnf(c_391,plain,
( powerset(sK4) != X1
| X0 != sK3
| ~ in(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_97,c_64]) ).
cnf(c_392,plain,
~ in(sK3,powerset(sK4)),
inference(unflattening,[status(thm)],[c_391]) ).
cnf(c_649,negated_conjecture,
( ~ in(X0,sK3)
| in(X0,sK4) ),
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_1234,plain,
~ subset(sK3,sK4),
inference(superposition,[status(thm)],[c_52,c_392]) ).
cnf(c_1253,plain,
( in(sK1(sK3,X0),sK4)
| subset(sK3,X0) ),
inference(superposition,[status(thm)],[c_59,c_649]) ).
cnf(c_1279,plain,
subset(sK3,sK4),
inference(superposition,[status(thm)],[c_1253,c_58]) ).
cnf(c_1280,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1279,c_1234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SEU173+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 17:38:41 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.70/1.15 % SZS status Started for theBenchmark.p
% 2.70/1.15 % SZS status Theorem for theBenchmark.p
% 2.70/1.15
% 2.70/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.70/1.15
% 2.70/1.15 ------ iProver source info
% 2.70/1.15
% 2.70/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.70/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.70/1.15 git: non_committed_changes: false
% 2.70/1.15
% 2.70/1.15 ------ Parsing...
% 2.70/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.70/1.15
% 2.70/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e
% 2.70/1.15
% 2.70/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.70/1.15
% 2.70/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.70/1.15 ------ Proving...
% 2.70/1.15 ------ Problem Properties
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15 clauses 27
% 2.70/1.15 conjectures 1
% 2.70/1.15 EPR 10
% 2.70/1.15 Horn 23
% 2.70/1.15 unary 9
% 2.70/1.15 binary 13
% 2.70/1.15 lits 50
% 2.70/1.15 lits eq 9
% 2.70/1.15 fd_pure 0
% 2.70/1.15 fd_pseudo 0
% 2.70/1.15 fd_cond 1
% 2.70/1.15 fd_pseudo_cond 3
% 2.70/1.15 AC symbols 0
% 2.70/1.15
% 2.70/1.15 ------ Schedule dynamic 5 is on
% 2.70/1.15
% 2.70/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15 ------
% 2.70/1.15 Current options:
% 2.70/1.15 ------
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15 ------ Proving...
% 2.70/1.15
% 2.70/1.15
% 2.70/1.15 % SZS status Theorem for theBenchmark.p
% 2.70/1.15
% 2.70/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.70/1.15
% 2.70/1.15
%------------------------------------------------------------------------------