TSTP Solution File: SEU160+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:14 EDT 2023
% Result : Theorem 1.75s 1.14s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 107 ( 73 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 116 ( 44 ~; 53 |; 14 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 37 ( 3 sgn; 19 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f5,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f8,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f1]) ).
fof(f9,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f15,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK2 != singleton(sK3)
& empty_set != sK2 )
| ~ subset(sK2,singleton(sK3)) )
& ( sK2 = singleton(sK3)
| empty_set = sK2
| subset(sK2,singleton(sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ( ( sK2 != singleton(sK3)
& empty_set != sK2 )
| ~ subset(sK2,singleton(sK3)) )
& ( sK2 = singleton(sK3)
| empty_set = sK2
| subset(sK2,singleton(sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[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,[],[f7]) ).
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(f20,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
( sK2 = singleton(sK3)
| empty_set = sK2
| subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
( empty_set != sK2
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
( sK2 != singleton(sK3)
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f27,plain,
! [X0,X1] :
( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X0,singleton(X1))
| empty_set != X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f28]) ).
cnf(c_49,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f20]) ).
cnf(c_53,negated_conjecture,
( singleton(sK3) != sK2
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
( empty_set != sK2
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,negated_conjecture,
( singleton(sK3) = sK2
| empty_set = sK2
| subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,plain,
subset(empty_set,singleton(X0)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_58,plain,
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| X0 = empty_set ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_137,plain,
( singleton(sK3) != X0
| singleton(sK3) != sK2
| X0 != sK2 ),
inference(resolution_lifted,[status(thm)],[c_49,c_53]) ).
cnf(c_138,plain,
singleton(sK3) != sK2,
inference(unflattening,[status(thm)],[c_137]) ).
cnf(c_144,plain,
( singleton(X0) != singleton(sK3)
| empty_set != sK2 ),
inference(resolution_lifted,[status(thm)],[c_54,c_57]) ).
cnf(c_153,plain,
( singleton(X0) != singleton(sK3)
| X1 != sK2
| singleton(X0) = X1
| singleton(sK3) = sK2
| X1 = empty_set
| empty_set = sK2 ),
inference(resolution_lifted,[status(thm)],[c_55,c_58]) ).
cnf(c_154,plain,
( singleton(X0) != singleton(sK3)
| singleton(X0) = sK2
| singleton(sK3) = sK2
| empty_set = sK2
| sK2 = empty_set ),
inference(unflattening,[status(thm)],[c_153]) ).
cnf(c_156,plain,
( singleton(X0) != singleton(sK3)
| singleton(X0) = sK2
| sK2 = empty_set ),
inference(global_subsumption_just,[status(thm)],[c_154,c_138,c_144,c_154]) ).
cnf(c_301,plain,
empty_set != sK2,
inference(equality_resolution,[status(thm)],[c_144]) ).
cnf(c_305,plain,
( singleton(sK3) = sK2
| empty_set = sK2 ),
inference(equality_resolution,[status(thm)],[c_156]) ).
cnf(c_306,plain,
empty_set = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_305,c_138]) ).
cnf(c_308,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_306,c_301]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.34 % Computer : n026.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Wed Aug 23 15:40:46 EDT 2023
% 0.15/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
% 1.75/1.14 % SZS status Started for theBenchmark.p
% 1.75/1.14 % SZS status Theorem for theBenchmark.p
% 1.75/1.14
% 1.75/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.75/1.14
% 1.75/1.14 ------ iProver source info
% 1.75/1.14
% 1.75/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.75/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.75/1.14 git: non_committed_changes: false
% 1.75/1.14 git: last_make_outside_of_git: false
% 1.75/1.14
% 1.75/1.14 ------ Parsing...
% 1.75/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.75/1.14
% 1.75/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.75/1.14
% 1.75/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.14
% 1.75/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.75/1.14 ------ Proving...
% 1.75/1.14 ------ Problem Properties
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14 clauses 6
% 1.75/1.14 conjectures 0
% 1.75/1.14 EPR 3
% 1.75/1.14 Horn 5
% 1.75/1.14 unary 4
% 1.75/1.14 binary 1
% 1.75/1.14 lits 9
% 1.75/1.14 lits eq 6
% 1.75/1.14 fd_pure 0
% 1.75/1.14 fd_pseudo 0
% 1.75/1.14 fd_cond 0
% 1.75/1.14 fd_pseudo_cond 0
% 1.75/1.14 AC symbols 0
% 1.75/1.14
% 1.75/1.14 ------ Schedule dynamic 5 is on
% 1.75/1.14
% 1.75/1.14 ------ no conjectures: strip conj schedule
% 1.75/1.14
% 1.75/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14 ------
% 1.75/1.14 Current options:
% 1.75/1.14 ------
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14 ------ Proving...
% 1.75/1.14
% 1.75/1.14
% 1.75/1.14 % SZS status Theorem for theBenchmark.p
% 1.75/1.14
% 1.75/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.14
% 1.75/1.14
%------------------------------------------------------------------------------