TSTP Solution File: SEU148+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:05 EDT 2023
% Result : Theorem 2.93s 1.16s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 85 ( 41 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 93 ( 37 ~; 33 |; 16 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 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 : 47 ( 0 sgn; 36 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f31,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f64,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f66,conjecture,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f67,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f66]) ).
fof(f107,plain,
? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f114,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f115,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f115,f116]) ).
fof(f151,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f167,plain,
( ? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) )
=> ( sK13 != sK14
& subset(singleton(sK13),singleton(sK14)) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
( sK13 != sK14
& subset(singleton(sK13),singleton(sK14)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f107,f167]) ).
fof(f178,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f225,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f151]) ).
fof(f267,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f269,plain,
subset(singleton(sK13),singleton(sK14)),
inference(cnf_transformation,[],[f168]) ).
fof(f270,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f168]) ).
fof(f281,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f178,f267]) ).
fof(f293,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f225,f267]) ).
fof(f306,plain,
subset(unordered_pair(sK13,sK13),unordered_pair(sK14,sK14)),
inference(definition_unfolding,[],[f269,f267,f267]) ).
fof(f311,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f281]) ).
cnf(c_60,plain,
( ~ in(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f311]) ).
cnf(c_105,plain,
( ~ subset(unordered_pair(X0,X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f293]) ).
cnf(c_146,negated_conjecture,
sK13 != sK14,
inference(cnf_transformation,[],[f270]) ).
cnf(c_147,negated_conjecture,
subset(unordered_pair(sK13,sK13),unordered_pair(sK14,sK14)),
inference(cnf_transformation,[],[f306]) ).
cnf(c_4205,plain,
in(sK13,unordered_pair(sK14,sK14)),
inference(superposition,[status(thm)],[c_147,c_105]) ).
cnf(c_4304,plain,
sK13 = sK14,
inference(superposition,[status(thm)],[c_4205,c_60]) ).
cnf(c_4305,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4304,c_146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 23:47:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.93/1.16 % SZS status Started for theBenchmark.p
% 2.93/1.16 % SZS status Theorem for theBenchmark.p
% 2.93/1.16
% 2.93/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.93/1.16
% 2.93/1.16 ------ iProver source info
% 2.93/1.16
% 2.93/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.93/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.93/1.16 git: non_committed_changes: false
% 2.93/1.16 git: last_make_outside_of_git: false
% 2.93/1.16
% 2.93/1.16 ------ Parsing...
% 2.93/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.93/1.16
% 2.93/1.16 ------ Preprocessing... sup_sim: 3 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
% 2.93/1.16
% 2.93/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.93/1.16
% 2.93/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.93/1.16 ------ Proving...
% 2.93/1.16 ------ Problem Properties
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16 clauses 94
% 2.93/1.16 conjectures 2
% 2.93/1.16 EPR 22
% 2.93/1.16 Horn 73
% 2.93/1.16 unary 25
% 2.93/1.16 binary 36
% 2.93/1.16 lits 200
% 2.93/1.16 lits eq 56
% 2.93/1.16 fd_pure 0
% 2.93/1.16 fd_pseudo 0
% 2.93/1.16 fd_cond 3
% 2.93/1.16 fd_pseudo_cond 22
% 2.93/1.16 AC symbols 0
% 2.93/1.16
% 2.93/1.16 ------ Schedule dynamic 5 is on
% 2.93/1.16
% 2.93/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16 ------
% 2.93/1.16 Current options:
% 2.93/1.16 ------
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16 ------ Proving...
% 2.93/1.16
% 2.93/1.16
% 2.93/1.16 % SZS status Theorem for theBenchmark.p
% 2.93/1.16
% 2.93/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.93/1.16
% 2.93/1.16
%------------------------------------------------------------------------------