TSTP Solution File: SEU152+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU152+2 : 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 : Thu Aug 31 17:04:09 EDT 2023
% Result : Theorem 3.30s 1.17s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 44 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 10 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,conjecture,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
inference(negated_conjecture,[],[f31]) ).
fof(f33,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f42,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f67,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f91,plain,
? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f96,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f159,plain,
( ? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) )
=> ( sK9 != set_union2(singleton(sK8),sK9)
& in(sK8,sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( sK9 != set_union2(singleton(sK8),sK9)
& in(sK8,sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f91,f159]) ).
fof(f161,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f233,plain,
in(sK8,sK9),
inference(cnf_transformation,[],[f160]) ).
fof(f234,plain,
sK9 != set_union2(singleton(sK8),sK9),
inference(cnf_transformation,[],[f160]) ).
fof(f236,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f161]) ).
fof(f248,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f96]) ).
fof(f278,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f304,plain,
sK9 != set_union2(unordered_pair(sK8,sK8),sK9),
inference(definition_unfolding,[],[f234,f278]) ).
fof(f305,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f236,f278]) ).
cnf(c_104,negated_conjecture,
set_union2(unordered_pair(sK8,sK8),sK9) != sK9,
inference(cnf_transformation,[],[f304]) ).
cnf(c_105,negated_conjecture,
in(sK8,sK9),
inference(cnf_transformation,[],[f233]) ).
cnf(c_106,plain,
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(cnf_transformation,[],[f305]) ).
cnf(c_119,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f248]) ).
cnf(c_3501,plain,
( ~ in(sK8,sK9)
| subset(unordered_pair(sK8,sK8),sK9) ),
inference(instantiation,[status(thm)],[c_106]) ).
cnf(c_3548,plain,
( ~ subset(unordered_pair(sK8,sK8),sK9)
| set_union2(unordered_pair(sK8,sK8),sK9) = sK9 ),
inference(instantiation,[status(thm)],[c_119]) ).
cnf(c_3549,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3548,c_3501,c_104,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU152+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n005.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 : Wed Aug 23 17:06:09 EDT 2023
% 0.14/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
% 3.30/1.17 % SZS status Started for theBenchmark.p
% 3.30/1.17 % SZS status Theorem for theBenchmark.p
% 3.30/1.17
% 3.30/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.30/1.17
% 3.30/1.17 ------ iProver source info
% 3.30/1.17
% 3.30/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.30/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.30/1.17 git: non_committed_changes: false
% 3.30/1.17 git: last_make_outside_of_git: false
% 3.30/1.17
% 3.30/1.17 ------ Parsing...
% 3.30/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.30/1.17
% 3.30/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.30/1.17
% 3.30/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.30/1.17
% 3.30/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.30/1.17 ------ Proving...
% 3.30/1.17 ------ Problem Properties
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 clauses 100
% 3.30/1.17 conjectures 2
% 3.30/1.17 EPR 22
% 3.30/1.17 Horn 78
% 3.30/1.17 unary 26
% 3.30/1.17 binary 40
% 3.30/1.17 lits 212
% 3.30/1.17 lits eq 66
% 3.30/1.17 fd_pure 0
% 3.30/1.17 fd_pseudo 0
% 3.30/1.17 fd_cond 3
% 3.30/1.17 fd_pseudo_cond 26
% 3.30/1.17 AC symbols 0
% 3.30/1.17
% 3.30/1.17 ------ Input Options Time Limit: Unbounded
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 ------
% 3.30/1.17 Current options:
% 3.30/1.17 ------
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 ------ Proving...
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 % SZS status Theorem for theBenchmark.p
% 3.30/1.17
% 3.30/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/1.17
% 3.30/1.17
%------------------------------------------------------------------------------