TSTP Solution File: SEU120+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU120+2 : TPTP v8.1.2. Released v3.3.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 : Fri May 3 03:04:33 EDT 2024
% Result : Theorem 0.42s 1.10s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f18,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f22,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f23,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f24,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f23]) ).
fof(f25,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0] :
( ( empty_set = X0
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f25]) ).
fof(f32,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f39,plain,
( ? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) )
=> ( ( disjoint(sK5,sK6)
& ? [X2] : in(X2,set_intersection2(sK5,sK6)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK5,sK6))
& ~ disjoint(sK5,sK6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
( ? [X2] : in(X2,set_intersection2(sK5,sK6))
=> in(sK7,set_intersection2(sK5,sK6)) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
( ( disjoint(sK5,sK6)
& in(sK7,set_intersection2(sK5,sK6)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK5,sK6))
& ~ disjoint(sK5,sK6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f22,f40,f39]) ).
fof(f44,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0] :
( empty_set = X0
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f52,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
( in(sK7,set_intersection2(sK5,sK6))
| ~ disjoint(sK5,sK6) ),
inference(cnf_transformation,[],[f41]) ).
fof(f65,plain,
! [X3] :
( disjoint(sK5,sK6)
| ~ in(X3,set_intersection2(sK5,sK6)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f66,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f44]) ).
cnf(c_51,plain,
( X0 = empty_set
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_52,plain,
~ in(X0,empty_set),
inference(cnf_transformation,[],[f66]) ).
cnf(c_59,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_60,plain,
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_69,negated_conjecture,
( ~ in(X0,set_intersection2(sK5,sK6))
| disjoint(sK5,sK6) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_71,negated_conjecture,
( ~ disjoint(sK5,sK6)
| in(sK7,set_intersection2(sK5,sK6)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_350,plain,
set_intersection2(sK5,sK6) = sP0_iProver_def,
definition ).
cnf(c_351,negated_conjecture,
( ~ disjoint(sK5,sK6)
| in(sK7,sP0_iProver_def) ),
inference(demodulation,[status(thm)],[c_71,c_350]) ).
cnf(c_353,negated_conjecture,
( ~ in(X0,sP0_iProver_def)
| disjoint(sK5,sK6) ),
inference(demodulation,[status(thm)],[c_69]) ).
cnf(c_836,plain,
( empty_set = sP0_iProver_def
| disjoint(sK5,sK6) ),
inference(superposition,[status(thm)],[c_51,c_353]) ).
cnf(c_1003,plain,
( empty_set != sP0_iProver_def
| disjoint(sK5,sK6) ),
inference(superposition,[status(thm)],[c_350,c_59]) ).
cnf(c_1086,plain,
disjoint(sK5,sK6),
inference(global_subsumption_just,[status(thm)],[c_1003,c_836,c_1003]) ).
cnf(c_1088,plain,
in(sK7,sP0_iProver_def),
inference(backward_subsumption_resolution,[status(thm)],[c_351,c_1086]) ).
cnf(c_1104,plain,
set_intersection2(sK5,sK6) = empty_set,
inference(superposition,[status(thm)],[c_1086,c_60]) ).
cnf(c_1107,plain,
empty_set = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_1104,c_350]) ).
cnf(c_1114,plain,
~ in(X0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_52,c_1107]) ).
cnf(c_1116,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1088,c_1114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU120+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu May 2 18:00:06 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 0.42/1.10 % SZS status Started for theBenchmark.p
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.10
% 0.42/1.10 ------ iProver source info
% 0.42/1.10
% 0.42/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.10 git: non_committed_changes: false
% 0.42/1.10
% 0.42/1.10 ------ Parsing...
% 0.42/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/1.10 ------ Proving...
% 0.42/1.10 ------ Problem Properties
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 clauses 24
% 0.42/1.10 conjectures 3
% 0.42/1.10 EPR 10
% 0.42/1.10 Horn 19
% 0.42/1.10 unary 7
% 0.42/1.10 binary 12
% 0.42/1.10 lits 47
% 0.42/1.10 lits eq 9
% 0.42/1.10 fd_pure 0
% 0.42/1.10 fd_pseudo 0
% 0.42/1.10 fd_cond 1
% 0.42/1.10 fd_pseudo_cond 3
% 0.42/1.10 AC symbols 0
% 0.42/1.10
% 0.42/1.10 ------ Schedule dynamic 5 is on
% 0.42/1.10
% 0.42/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------
% 0.42/1.10 Current options:
% 0.42/1.10 ------
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------ Proving...
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.10
% 0.42/1.10
%------------------------------------------------------------------------------