TSTP Solution File: SEU149+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:06 EDT 2023
% Result : Theorem 1.81s 1.14s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 146 ( 99 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 183 ( 67 ~; 68 |; 39 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 74 ( 1 sgn; 57 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f10,plain,
? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,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,[],[f3]) ).
fof(f12,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,[],[f11]) ).
fof(f13,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(f14,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])],[f12,f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK1(X0,X1,X2) != X1
& sK1(X0,X1,X2) != X0 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X1
| sK1(X0,X1,X2) = X0
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK1(X0,X1,X2) != X1
& sK1(X0,X1,X2) != X0 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X1
| sK1(X0,X1,X2) = X0
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f17,f18]) ).
fof(f24,plain,
( ? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK4 != sK5
& singleton(sK4) = unordered_pair(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( sK4 != sK5
& singleton(sK4) = unordered_pair(sK5,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f10,f24]) ).
fof(f28,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f14]) ).
fof(f33,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
singleton(sK4) = unordered_pair(sK5,sK6),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
sK4 != sK5,
inference(cnf_transformation,[],[f25]) ).
fof(f44,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f28]) ).
fof(f47,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f33]) ).
fof(f48,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f47]) ).
cnf(c_54,plain,
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_59,plain,
in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f48]) ).
cnf(c_63,negated_conjecture,
sK4 != sK5,
inference(cnf_transformation,[],[f41]) ).
cnf(c_64,negated_conjecture,
unordered_pair(sK5,sK6) = singleton(sK4),
inference(cnf_transformation,[],[f40]) ).
cnf(c_487,plain,
in(sK5,singleton(sK4)),
inference(superposition,[status(thm)],[c_64,c_59]) ).
cnf(c_507,plain,
sK4 = sK5,
inference(superposition,[status(thm)],[c_487,c_54]) ).
cnf(c_508,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_507,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.16/0.33 % Computer : n020.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Wed Aug 23 21:53:01 EDT 2023
% 0.16/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.81/1.14 % SZS status Started for theBenchmark.p
% 1.81/1.14 % SZS status Theorem for theBenchmark.p
% 1.81/1.14
% 1.81/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.81/1.14
% 1.81/1.14 ------ iProver source info
% 1.81/1.14
% 1.81/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.81/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.81/1.14 git: non_committed_changes: false
% 1.81/1.14 git: last_make_outside_of_git: false
% 1.81/1.14
% 1.81/1.14 ------ Parsing...
% 1.81/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.81/1.14
% 1.81/1.14 ------ 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
% 1.81/1.14
% 1.81/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.81/1.14
% 1.81/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.81/1.14 ------ Proving...
% 1.81/1.14 ------ Problem Properties
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14 clauses 15
% 1.81/1.14 conjectures 2
% 1.81/1.14 EPR 3
% 1.81/1.14 Horn 12
% 1.81/1.14 unary 7
% 1.81/1.14 binary 2
% 1.81/1.14 lits 30
% 1.81/1.14 lits eq 18
% 1.81/1.14 fd_pure 0
% 1.81/1.14 fd_pseudo 0
% 1.81/1.14 fd_cond 0
% 1.81/1.14 fd_pseudo_cond 5
% 1.81/1.14 AC symbols 0
% 1.81/1.14
% 1.81/1.14 ------ Schedule dynamic 5 is on
% 1.81/1.14
% 1.81/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14 ------
% 1.81/1.14 Current options:
% 1.81/1.14 ------
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14 ------ Proving...
% 1.81/1.14
% 1.81/1.14
% 1.81/1.14 % SZS status Theorem for theBenchmark.p
% 1.81/1.14
% 1.81/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.14
% 1.81/1.14
%------------------------------------------------------------------------------