TSTP Solution File: SEU148+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU148+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 1.96s 1.16s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 108 ( 67 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 120 ( 48 ~; 46 |; 19 &)
% ( 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; 3 con; 0-2 aty)
% Number of variables : 56 ( 1 sgn; 39 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,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] : singleton(X0) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f9]) ).
fof(f13,plain,
? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,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,[],[f2]) ).
fof(f15,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,[],[f14]) ).
fof(f16,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(f17,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])],[f15,f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f24,plain,
( ? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) )
=> ( sK3 != sK4
& subset(singleton(sK3),singleton(sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( sK3 != sK4
& subset(singleton(sK3),singleton(sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f24]) ).
fof(f27,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f4]) ).
fof(f33,plain,
! [X0,X1] :
( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
subset(singleton(sK3),singleton(sK4)),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f28]) ).
fof(f42,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f41]) ).
fof(f43,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f27]) ).
cnf(c_52,plain,
in(X0,singleton(X0)),
inference(cnf_transformation,[],[f42]) ).
cnf(c_53,plain,
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_55,plain,
singleton(X0) != empty_set,
inference(cnf_transformation,[],[f32]) ).
cnf(c_58,plain,
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| X0 = empty_set ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_62,negated_conjecture,
sK3 != sK4,
inference(cnf_transformation,[],[f40]) ).
cnf(c_63,negated_conjecture,
subset(singleton(sK3),singleton(sK4)),
inference(cnf_transformation,[],[f39]) ).
cnf(c_163,plain,
( singleton(X0) != singleton(sK4)
| singleton(sK3) != X1
| singleton(X0) = X1
| X1 = empty_set ),
inference(resolution_lifted,[status(thm)],[c_58,c_63]) ).
cnf(c_164,plain,
( singleton(X0) != singleton(sK4)
| singleton(X0) = singleton(sK3)
| singleton(sK3) = empty_set ),
inference(unflattening,[status(thm)],[c_163]) ).
cnf(c_172,plain,
( singleton(X0) != singleton(sK4)
| singleton(X0) = singleton(sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_164,c_55]) ).
cnf(c_389,plain,
singleton(sK3) = singleton(sK4),
inference(equality_resolution,[status(thm)],[c_172]) ).
cnf(c_391,plain,
in(sK4,singleton(sK3)),
inference(superposition,[status(thm)],[c_389,c_52]) ).
cnf(c_403,plain,
sK3 = sK4,
inference(superposition,[status(thm)],[c_391,c_53]) ).
cnf(c_405,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_403,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU148+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n028.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 16:52:34 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.96/1.16 % SZS status Started for theBenchmark.p
% 1.96/1.16 % SZS status Theorem for theBenchmark.p
% 1.96/1.16
% 1.96/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.96/1.16
% 1.96/1.16 ------ iProver source info
% 1.96/1.16
% 1.96/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.96/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.96/1.16 git: non_committed_changes: false
% 1.96/1.16 git: last_make_outside_of_git: false
% 1.96/1.16
% 1.96/1.16 ------ Parsing...
% 1.96/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.96/1.16
% 1.96/1.16 ------ 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.96/1.16
% 1.96/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.96/1.16
% 1.96/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.96/1.16 ------ Proving...
% 1.96/1.16 ------ Problem Properties
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 clauses 11
% 1.96/1.16 conjectures 1
% 1.96/1.16 EPR 5
% 1.96/1.16 Horn 10
% 1.96/1.16 unary 6
% 1.96/1.16 binary 3
% 1.96/1.16 lits 18
% 1.96/1.16 lits eq 9
% 1.96/1.16 fd_pure 0
% 1.96/1.16 fd_pseudo 0
% 1.96/1.16 fd_cond 0
% 1.96/1.16 fd_pseudo_cond 2
% 1.96/1.16 AC symbols 0
% 1.96/1.16
% 1.96/1.16 ------ Schedule dynamic 5 is on
% 1.96/1.16
% 1.96/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 ------
% 1.96/1.16 Current options:
% 1.96/1.16 ------
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 ------ Proving...
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 % SZS status Theorem for theBenchmark.p
% 1.96/1.16
% 1.96/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.16
% 1.96/1.16
%------------------------------------------------------------------------------