TSTP Solution File: SEU140+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:00 EDT 2023
% Result : Theorem 1.88s 1.17s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 80 ( 18 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 66 ( 27 ~; 19 |; 13 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn; 36 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f12,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f14,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f14]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f28,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f27]) ).
fof(f31,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f36,plain,
( ? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) )
=> ( ~ disjoint(sK2,sK4)
& disjoint(sK3,sK4)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ~ disjoint(sK2,sK4)
& disjoint(sK3,sK4)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f28,f36]) ).
fof(f38,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f39,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f40,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f31]) ).
fof(f46,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f47,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(cnf_transformation,[],[f26]) ).
fof(f50,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f37]) ).
fof(f51,plain,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f37]) ).
fof(f52,plain,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f37]) ).
cnf(c_49,plain,
set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f38]) ).
cnf(c_50,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_51,plain,
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_57,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_58,plain,
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_60,plain,
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_61,negated_conjecture,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f52]) ).
cnf(c_62,negated_conjecture,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f51]) ).
cnf(c_63,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f50]) ).
cnf(c_506,plain,
disjoint(sK4,sK3),
inference(superposition,[status(thm)],[c_62,c_57]) ).
cnf(c_551,plain,
set_intersection2(sK4,sK3) = empty_set,
inference(superposition,[status(thm)],[c_506,c_51]) ).
cnf(c_581,plain,
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X2,X1)) ),
inference(superposition,[status(thm)],[c_49,c_58]) ).
cnf(c_687,plain,
( set_intersection2(sK2,sK4) != empty_set
| disjoint(sK2,sK4) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_959,plain,
( ~ subset(X0,sK3)
| subset(set_intersection2(X0,sK4),empty_set) ),
inference(superposition,[status(thm)],[c_551,c_581]) ).
cnf(c_1054,plain,
( ~ subset(X0,sK3)
| set_intersection2(X0,sK4) = empty_set ),
inference(superposition,[status(thm)],[c_959,c_60]) ).
cnf(c_1105,plain,
set_intersection2(sK2,sK4) = empty_set,
inference(superposition,[status(thm)],[c_63,c_1054]) ).
cnf(c_1112,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1105,c_687,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 23 15:07:08 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.88/1.17 % SZS status Started for theBenchmark.p
% 1.88/1.17 % SZS status Theorem for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.88/1.17
% 1.88/1.17 ------ iProver source info
% 1.88/1.17
% 1.88/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.88/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.88/1.17 git: non_committed_changes: false
% 1.88/1.17 git: last_make_outside_of_git: false
% 1.88/1.17
% 1.88/1.17 ------ Parsing...
% 1.88/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.17 ------ Proving...
% 1.88/1.17 ------ Problem Properties
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 clauses 17
% 1.88/1.17 conjectures 3
% 1.88/1.17 EPR 11
% 1.88/1.17 Horn 17
% 1.88/1.17 unary 10
% 1.88/1.17 binary 6
% 1.88/1.17 lits 25
% 1.88/1.17 lits eq 8
% 1.88/1.17 fd_pure 0
% 1.88/1.17 fd_pseudo 0
% 1.88/1.17 fd_cond 2
% 1.88/1.17 fd_pseudo_cond 1
% 1.88/1.17 AC symbols 0
% 1.88/1.17
% 1.88/1.17 ------ Schedule dynamic 5 is on
% 1.88/1.17
% 1.88/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------
% 1.88/1.17 Current options:
% 1.88/1.17 ------
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------ Proving...
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 % SZS status Theorem for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.17
% 1.88/1.17
%------------------------------------------------------------------------------