TSTP Solution File: SET873+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET873+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:01:53 EDT 2024
% Result : Theorem 2.11s 1.24s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f7,axiom,
! [X0,X1] :
( subset(set_union2(singleton(X0),X1),X1)
=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f11,conjecture,
! [X0,X1] :
( singleton(X0) = set_union2(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( singleton(X0) = set_union2(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f11]) ).
fof(f14,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f10]) ).
fof(f18,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(set_union2(singleton(X0),X1),X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f19,plain,
? [X0,X1] :
( X0 != X1
& singleton(X0) = set_union2(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f20,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(f21,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,[],[f20]) ).
fof(f22,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(f23,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])],[f21,f22]) ).
fof(f28,plain,
( ? [X0,X1] :
( X0 != X1
& singleton(X0) = set_union2(singleton(X0),singleton(X1)) )
=> ( sK3 != sK4
& singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( sK3 != sK4
& singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f19,f28]) ).
fof(f31,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f32,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(set_union2(singleton(X0),X1),X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f42,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f43,plain,
singleton(sK3) = set_union2(singleton(sK3),singleton(sK4)),
inference(cnf_transformation,[],[f29]) ).
fof(f44,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f29]) ).
fof(f47,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f32]) ).
cnf(c_50,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f31]) ).
cnf(c_54,plain,
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_58,plain,
( ~ subset(set_union2(singleton(X0),X1),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_61,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f42]) ).
cnf(c_62,negated_conjecture,
sK3 != sK4,
inference(cnf_transformation,[],[f44]) ).
cnf(c_63,negated_conjecture,
set_union2(singleton(sK3),singleton(sK4)) = singleton(sK3),
inference(cnf_transformation,[],[f43]) ).
cnf(c_160,plain,
( set_union2(singleton(X0),X1) != X2
| X1 != X2
| in(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_58,c_61]) ).
cnf(c_161,plain,
( set_union2(singleton(X0),X1) != X1
| in(X0,X1) ),
inference(unflattening,[status(thm)],[c_160]) ).
cnf(c_254,plain,
singleton(sK3) = sP0_iProver_def,
definition ).
cnf(c_255,plain,
singleton(sK4) = sP1_iProver_def,
definition ).
cnf(c_256,plain,
set_union2(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_257,negated_conjecture,
sP2_iProver_def = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_63,c_255,c_254,c_256]) ).
cnf(c_258,negated_conjecture,
sK3 != sK4,
inference(demodulation,[status(thm)],[c_62]) ).
cnf(c_441,plain,
set_union2(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_256,c_257]) ).
cnf(c_477,plain,
( ~ in(X0,sP0_iProver_def)
| X0 = sK3 ),
inference(superposition,[status(thm)],[c_254,c_54]) ).
cnf(c_502,plain,
( set_union2(sP1_iProver_def,X0) != X0
| in(sK4,X0) ),
inference(superposition,[status(thm)],[c_255,c_161]) ).
cnf(c_562,plain,
( set_union2(X0,sP1_iProver_def) != X0
| in(sK4,X0) ),
inference(superposition,[status(thm)],[c_50,c_502]) ).
cnf(c_582,plain,
in(sK4,sP0_iProver_def),
inference(superposition,[status(thm)],[c_441,c_562]) ).
cnf(c_584,plain,
sK3 = sK4,
inference(superposition,[status(thm)],[c_582,c_477]) ).
cnf(c_585,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_584,c_258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET873+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n005.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 20:12:41 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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
% 2.11/1.24 % SZS status Started for theBenchmark.p
% 2.11/1.24 % SZS status Theorem for theBenchmark.p
% 2.11/1.24
% 2.11/1.24 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.11/1.24
% 2.11/1.24 ------ iProver source info
% 2.11/1.24
% 2.11/1.24 git: date: 2024-05-02 19:28:25 +0000
% 2.11/1.24 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.11/1.24 git: non_committed_changes: false
% 2.11/1.24
% 2.11/1.24 ------ Parsing...
% 2.11/1.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.11/1.24
% 2.11/1.24 ------ 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
% 2.11/1.24
% 2.11/1.24 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.11/1.24
% 2.11/1.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.11/1.24 ------ Proving...
% 2.11/1.24 ------ Problem Properties
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24 clauses 17
% 2.11/1.24 conjectures 2
% 2.11/1.24 EPR 5
% 2.11/1.24 Horn 16
% 2.11/1.24 unary 10
% 2.11/1.24 binary 5
% 2.11/1.24 lits 26
% 2.11/1.24 lits eq 13
% 2.11/1.24 fd_pure 0
% 2.11/1.24 fd_pseudo 0
% 2.11/1.24 fd_cond 0
% 2.11/1.24 fd_pseudo_cond 2
% 2.11/1.24 AC symbols 0
% 2.11/1.24
% 2.11/1.24 ------ Schedule dynamic 5 is on
% 2.11/1.24
% 2.11/1.24 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24 ------
% 2.11/1.24 Current options:
% 2.11/1.24 ------
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24 ------ Proving...
% 2.11/1.24
% 2.11/1.24
% 2.11/1.24 % SZS status Theorem for theBenchmark.p
% 2.11/1.24
% 2.11/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/1.24
% 2.11/1.24
%------------------------------------------------------------------------------