TSTP Solution File: SEU321+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU321+1 : TPTP v8.1.2. Released v3.3.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 17:05:47 EDT 2023
% Result : Theorem 2.50s 1.15s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 182 ( 8 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 216 ( 84 ~; 61 |; 52 &)
% ( 2 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn; 34 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f33,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f34,axiom,
( v5_membered(empty_set)
& v4_membered(empty_set)
& v3_membered(empty_set)
& v2_membered(empty_set)
& v1_membered(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc6_membered) ).
fof(f40,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( in(X2,subset_complement(the_carrier(X0),X1))
<=> ~ in(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_tops_1) ).
fof(f41,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( in(X2,subset_complement(the_carrier(X0),X1))
<=> ~ in(X2,X1) ) ) ) ),
inference(negated_conjecture,[],[f40]) ).
fof(f42,axiom,
! [X0] :
( empty_set != X0
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f43,axiom,
! [X0,X1,X2] :
( element(X2,powerset(X0))
=> ~ ( in(X1,X2)
& in(X1,subset_complement(X0,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1) ).
fof(f80,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f81,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f80]) ).
fof(f88,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,subset_complement(the_carrier(X0),X1))
<~> ~ in(X2,X1) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f89,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,subset_complement(the_carrier(X0),X1))
<~> ~ in(X2,X1) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( in(X2,subset_complement(X0,X1))
| in(X2,X1)
| ~ element(X2,X0) )
| ~ element(X1,powerset(X0)) )
| empty_set = X0 ),
inference(ennf_transformation,[],[f42]) ).
fof(f91,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( in(X2,subset_complement(X0,X1))
| in(X2,X1)
| ~ element(X2,X0) )
| ~ element(X1,powerset(X0)) )
| empty_set = X0 ),
inference(flattening,[],[f90]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ~ in(X1,X2)
| ~ in(X1,subset_complement(X0,X2))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ~ in(X1,X2)
| ~ in(X1,subset_complement(X0,X2))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f92]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,X1)
| ~ in(X2,subset_complement(the_carrier(X0),X1)) )
& ( ~ in(X2,X1)
| in(X2,subset_complement(the_carrier(X0),X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(nnf_transformation,[],[f89]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,X1)
| ~ in(X2,subset_complement(the_carrier(X0),X1)) )
& ( ~ in(X2,X1)
| in(X2,subset_complement(the_carrier(X0),X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,X1)
| ~ in(X2,subset_complement(the_carrier(X0),X1)) )
& ( ~ in(X2,X1)
| in(X2,subset_complement(the_carrier(X0),X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ( ? [X1] :
( ? [X2] :
( ( in(X2,X1)
| ~ in(X2,subset_complement(the_carrier(sK5),X1)) )
& ( ~ in(X2,X1)
| in(X2,subset_complement(the_carrier(sK5),X1)) )
& element(X2,the_carrier(sK5)) )
& element(X1,powerset(the_carrier(sK5))) )
& one_sorted_str(sK5)
& ~ empty_carrier(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( ? [X1] :
( ? [X2] :
( ( in(X2,X1)
| ~ in(X2,subset_complement(the_carrier(sK5),X1)) )
& ( ~ in(X2,X1)
| in(X2,subset_complement(the_carrier(sK5),X1)) )
& element(X2,the_carrier(sK5)) )
& element(X1,powerset(the_carrier(sK5))) )
=> ( ? [X2] :
( ( in(X2,sK6)
| ~ in(X2,subset_complement(the_carrier(sK5),sK6)) )
& ( ~ in(X2,sK6)
| in(X2,subset_complement(the_carrier(sK5),sK6)) )
& element(X2,the_carrier(sK5)) )
& element(sK6,powerset(the_carrier(sK5))) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
( ? [X2] :
( ( in(X2,sK6)
| ~ in(X2,subset_complement(the_carrier(sK5),sK6)) )
& ( ~ in(X2,sK6)
| in(X2,subset_complement(the_carrier(sK5),sK6)) )
& element(X2,the_carrier(sK5)) )
=> ( ( in(sK7,sK6)
| ~ in(sK7,subset_complement(the_carrier(sK5),sK6)) )
& ( ~ in(sK7,sK6)
| in(sK7,subset_complement(the_carrier(sK5),sK6)) )
& element(sK7,the_carrier(sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ( in(sK7,sK6)
| ~ in(sK7,subset_complement(the_carrier(sK5),sK6)) )
& ( ~ in(sK7,sK6)
| in(sK7,subset_complement(the_carrier(sK5),sK6)) )
& element(sK7,the_carrier(sK5))
& element(sK6,powerset(the_carrier(sK5)))
& one_sorted_str(sK5)
& ~ empty_carrier(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f105,f108,f107,f106]) ).
fof(f153,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f154,plain,
empty(empty_set),
inference(cnf_transformation,[],[f34]) ).
fof(f165,plain,
~ empty_carrier(sK5),
inference(cnf_transformation,[],[f109]) ).
fof(f166,plain,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f109]) ).
fof(f167,plain,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f109]) ).
fof(f168,plain,
element(sK7,the_carrier(sK5)),
inference(cnf_transformation,[],[f109]) ).
fof(f169,plain,
( ~ in(sK7,sK6)
| in(sK7,subset_complement(the_carrier(sK5),sK6)) ),
inference(cnf_transformation,[],[f109]) ).
fof(f170,plain,
( in(sK7,sK6)
| ~ in(sK7,subset_complement(the_carrier(sK5),sK6)) ),
inference(cnf_transformation,[],[f109]) ).
fof(f171,plain,
! [X2,X0,X1] :
( in(X2,subset_complement(X0,X1))
| in(X2,X1)
| ~ element(X2,X0)
| ~ element(X1,powerset(X0))
| empty_set = X0 ),
inference(cnf_transformation,[],[f91]) ).
fof(f172,plain,
! [X2,X0,X1] :
( ~ in(X1,X2)
| ~ in(X1,subset_complement(X0,X2))
| ~ element(X2,powerset(X0)) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_92,plain,
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_98,plain,
empty(empty_set),
inference(cnf_transformation,[],[f154]) ).
cnf(c_104,negated_conjecture,
( ~ in(sK7,subset_complement(the_carrier(sK5),sK6))
| in(sK7,sK6) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_105,negated_conjecture,
( ~ in(sK7,sK6)
| in(sK7,subset_complement(the_carrier(sK5),sK6)) ),
inference(cnf_transformation,[],[f169]) ).
cnf(c_106,negated_conjecture,
element(sK7,the_carrier(sK5)),
inference(cnf_transformation,[],[f168]) ).
cnf(c_107,negated_conjecture,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f167]) ).
cnf(c_108,negated_conjecture,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f166]) ).
cnf(c_109,negated_conjecture,
~ empty_carrier(sK5),
inference(cnf_transformation,[],[f165]) ).
cnf(c_110,plain,
( ~ element(X0,powerset(X1))
| ~ element(X2,X1)
| X1 = empty_set
| in(X2,subset_complement(X1,X0))
| in(X2,X0) ),
inference(cnf_transformation,[],[f171]) ).
cnf(c_111,plain,
( ~ in(X0,subset_complement(X1,X2))
| ~ element(X2,powerset(X1))
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f172]) ).
cnf(c_787,plain,
( X0 != sK5
| ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(resolution_lifted,[status(thm)],[c_92,c_109]) ).
cnf(c_788,plain,
( ~ empty(the_carrier(sK5))
| ~ one_sorted_str(sK5) ),
inference(unflattening,[status(thm)],[c_787]) ).
cnf(c_789,plain,
~ empty(the_carrier(sK5)),
inference(global_subsumption_just,[status(thm)],[c_788,c_108,c_788]) ).
cnf(c_1805,plain,
( ~ element(sK6,powerset(the_carrier(sK5)))
| ~ in(sK7,sK6) ),
inference(superposition,[status(thm)],[c_105,c_111]) ).
cnf(c_1807,plain,
~ in(sK7,sK6),
inference(forward_subsumption_resolution,[status(thm)],[c_1805,c_107]) ).
cnf(c_1811,plain,
~ in(sK7,subset_complement(the_carrier(sK5),sK6)),
inference(backward_subsumption_resolution,[status(thm)],[c_104,c_1807]) ).
cnf(c_1848,plain,
( ~ element(sK6,powerset(the_carrier(sK5)))
| ~ element(sK7,the_carrier(sK5))
| the_carrier(sK5) = empty_set
| in(sK7,sK6) ),
inference(superposition,[status(thm)],[c_110,c_1811]) ).
cnf(c_1849,plain,
the_carrier(sK5) = empty_set,
inference(forward_subsumption_resolution,[status(thm)],[c_1848,c_1807,c_106,c_107]) ).
cnf(c_1865,plain,
~ empty(empty_set),
inference(demodulation,[status(thm)],[c_789,c_1849]) ).
cnf(c_1868,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1865,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU321+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 22:07:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 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.50/1.15 % SZS status Started for theBenchmark.p
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.50/1.15
% 2.50/1.15 ------ iProver source info
% 2.50/1.15
% 2.50/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.50/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.50/1.15 git: non_committed_changes: false
% 2.50/1.15 git: last_make_outside_of_git: false
% 2.50/1.15
% 2.50/1.15 ------ Parsing...
% 2.50/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 40 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.50/1.15 ------ Proving...
% 2.50/1.15 ------ Problem Properties
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 clauses 26
% 2.50/1.15 conjectures 4
% 2.50/1.15 EPR 8
% 2.50/1.15 Horn 24
% 2.50/1.15 unary 12
% 2.50/1.15 binary 8
% 2.50/1.15 lits 48
% 2.50/1.15 lits eq 4
% 2.50/1.15 fd_pure 0
% 2.50/1.15 fd_pseudo 0
% 2.50/1.15 fd_cond 2
% 2.50/1.15 fd_pseudo_cond 1
% 2.50/1.15 AC symbols 0
% 2.50/1.15
% 2.50/1.15 ------ Schedule dynamic 5 is on
% 2.50/1.15
% 2.50/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------
% 2.50/1.15 Current options:
% 2.50/1.15 ------
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------ Proving...
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.15
% 2.50/1.16
%------------------------------------------------------------------------------