TSTP Solution File: SEU149+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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 : Fri May 3 03:04:42 EDT 2024
% Result : Theorem 3.47s 1.18s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f12,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f31,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f64,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f72,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f73,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[],[f72]) ).
fof(f83,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f113,plain,
? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f73]) ).
fof(f116,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(f117,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,[],[f116]) ).
fof(f118,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(f119,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])],[f117,f118]) ).
fof(f128,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,[],[f10]) ).
fof(f129,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,[],[f128]) ).
fof(f130,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,[],[f129]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(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,[sK3])],[f130,f131]) ).
fof(f138,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f139,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f138]) ).
fof(f140,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f139,f140]) ).
fof(f153,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f170,plain,
( ? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK13 != sK14
& singleton(sK13) = unordered_pair(sK14,sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f171,plain,
( sK13 != sK14
& singleton(sK13) = unordered_pair(sK14,sK15) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f113,f170]) ).
fof(f180,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f191,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f132]) ).
fof(f192,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f132]) ).
fof(f202,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f228,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f269,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f278,plain,
singleton(sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f171]) ).
fof(f279,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f171]) ).
fof(f284,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f180,f269]) ).
fof(f295,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f228,f269]) ).
fof(f310,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK13,sK13),
inference(definition_unfolding,[],[f278,f269]) ).
fof(f315,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f284]) ).
fof(f319,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f192]) ).
fof(f320,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f319]) ).
fof(f321,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f191]) ).
fof(f322,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f321]) ).
cnf(c_60,plain,
( ~ in(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f315]) ).
cnf(c_70,plain,
in(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f320]) ).
cnf(c_71,plain,
in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f322]) ).
cnf(c_81,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_104,plain,
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(cnf_transformation,[],[f295]) ).
cnf(c_153,negated_conjecture,
sK13 != sK14,
inference(cnf_transformation,[],[f279]) ).
cnf(c_154,negated_conjecture,
unordered_pair(sK13,sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f310]) ).
cnf(c_2303,plain,
unordered_pair(sK13,sK13) = sP0_iProver_def,
definition ).
cnf(c_2304,plain,
unordered_pair(sK14,sK15) = sP1_iProver_def,
definition ).
cnf(c_2305,negated_conjecture,
sP0_iProver_def = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_154,c_2304,c_2303]) ).
cnf(c_2306,negated_conjecture,
sK13 != sK14,
inference(demodulation,[status(thm)],[c_153]) ).
cnf(c_3835,plain,
unordered_pair(sK14,sK15) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_2304,c_2305]) ).
cnf(c_3837,plain,
in(sK14,sP0_iProver_def),
inference(superposition,[status(thm)],[c_3835,c_71]) ).
cnf(c_4242,plain,
( ~ in(sK13,X0)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_2303,c_104]) ).
cnf(c_4362,plain,
subset(sP0_iProver_def,unordered_pair(X0,sK13)),
inference(superposition,[status(thm)],[c_70,c_4242]) ).
cnf(c_4778,plain,
( ~ subset(sP0_iProver_def,X0)
| in(sK14,X0) ),
inference(superposition,[status(thm)],[c_3837,c_81]) ).
cnf(c_4896,plain,
in(sK14,unordered_pair(X0,sK13)),
inference(superposition,[status(thm)],[c_4362,c_4778]) ).
cnf(c_5257,plain,
sK13 = sK14,
inference(superposition,[status(thm)],[c_4896,c_60]) ).
cnf(c_5258,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5257,c_2306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 17:42:05 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.47/1.18 % SZS status Started for theBenchmark.p
% 3.47/1.18 % SZS status Theorem for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.47/1.18
% 3.47/1.18 ------ iProver source info
% 3.47/1.18
% 3.47/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.47/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.47/1.18 git: non_committed_changes: false
% 3.47/1.18
% 3.47/1.18 ------ Parsing...
% 3.47/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.47/1.18
% 3.47/1.18 ------ 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
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.18 ------ Proving...
% 3.47/1.18 ------ Problem Properties
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 clauses 97
% 3.47/1.18 conjectures 2
% 3.47/1.18 EPR 23
% 3.47/1.18 Horn 76
% 3.47/1.18 unary 27
% 3.47/1.18 binary 37
% 3.47/1.18 lits 204
% 3.47/1.18 lits eq 60
% 3.47/1.18 fd_pure 0
% 3.47/1.18 fd_pseudo 0
% 3.47/1.18 fd_cond 3
% 3.47/1.18 fd_pseudo_cond 23
% 3.47/1.18 AC symbols 0
% 3.47/1.18
% 3.47/1.18 ------ Schedule dynamic 5 is on
% 3.47/1.18
% 3.47/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------
% 3.47/1.18 Current options:
% 3.47/1.18 ------
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------ Proving...
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 % SZS status Theorem for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.18
% 3.47/1.18
%------------------------------------------------------------------------------