TSTP Solution File: SEU186+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:29 EDT 2023
% Result : Theorem 1.82s 1.18s
% Output : CNFRefutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 22 unt; 0 def)
% Number of atoms : 107 ( 36 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 101 ( 46 ~; 32 |; 12 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 2 sgn; 60 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0] :
( relation(X0)
<=> ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
fof(f5,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f11,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f22,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f23,conjecture,
! [X0] :
( relation(X0)
=> ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
=> empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t56_relat_1) ).
fof(f24,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
=> empty_set = X0 ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f25,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f28,plain,
! [X0] :
( relation(X0)
=> ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f31,plain,
! [X0] :
( ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f33,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f34,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f36,plain,
? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f40,plain,
! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
=> ordered_pair(sK0(X1),sK1(X1)) = X1 ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0] :
( ! [X1] :
( ordered_pair(sK0(X1),sK1(X1)) = X1
| ~ in(X1,X0) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f40]) ).
fof(f42,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK2(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0] : element(sK2(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f11,f42]) ).
fof(f52,plain,
( ? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) )
=> ( empty_set != sK7
& ! [X2,X1] : ~ in(ordered_pair(X1,X2),sK7)
& relation(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
( empty_set != sK7
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),sK7)
& relation(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f36,f52]) ).
fof(f56,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f57,plain,
! [X0,X1] :
( ordered_pair(sK0(X1),sK1(X1)) = X1
| ~ in(X1,X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f58,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f5]) ).
fof(f59,plain,
! [X0] : element(sK2(X0),X0),
inference(cnf_transformation,[],[f43]) ).
fof(f73,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f74,plain,
relation(sK7),
inference(cnf_transformation,[],[f53]) ).
fof(f75,plain,
! [X2,X1] : ~ in(ordered_pair(X1,X2),sK7),
inference(cnf_transformation,[],[f53]) ).
fof(f76,plain,
empty_set != sK7,
inference(cnf_transformation,[],[f53]) ).
fof(f77,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f80,plain,
! [X0,X1] :
( unordered_pair(unordered_pair(sK0(X1),sK1(X1)),singleton(sK0(X1))) = X1
| ~ in(X1,X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f57,f58]) ).
fof(f82,plain,
! [X2,X1] : ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),sK7),
inference(definition_unfolding,[],[f75,f58]) ).
cnf(c_51,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f56]) ).
cnf(c_52,plain,
( ~ in(X0,X1)
| ~ relation(X1)
| unordered_pair(unordered_pair(sK0(X0),sK1(X0)),singleton(sK0(X0))) = X0 ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_53,plain,
element(sK2(X0),X0),
inference(cnf_transformation,[],[f59]) ).
cnf(c_67,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_68,negated_conjecture,
empty_set != sK7,
inference(cnf_transformation,[],[f76]) ).
cnf(c_69,negated_conjecture,
~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK7),
inference(cnf_transformation,[],[f82]) ).
cnf(c_70,negated_conjecture,
relation(sK7),
inference(cnf_transformation,[],[f74]) ).
cnf(c_71,plain,
( ~ empty(X0)
| X0 = empty_set ),
inference(cnf_transformation,[],[f77]) ).
cnf(c_170,plain,
~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK7),
inference(demodulation,[status(thm)],[c_69,c_51]) ).
cnf(c_183,plain,
( ~ in(X0,X1)
| ~ relation(X1)
| unordered_pair(singleton(sK0(X0)),unordered_pair(sK0(X0),sK1(X0))) = X0 ),
inference(demodulation,[status(thm)],[c_52,c_51]) ).
cnf(c_202,plain,
( sK2(X0) != X1
| X0 != X2
| in(X1,X2)
| empty(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_67]) ).
cnf(c_203,plain,
( in(sK2(X0),X0)
| empty(X0) ),
inference(unflattening,[status(thm)],[c_202]) ).
cnf(c_620,plain,
( ~ relation(X0)
| unordered_pair(singleton(sK0(sK2(X0))),unordered_pair(sK0(sK2(X0)),sK1(sK2(X0)))) = sK2(X0)
| empty(X0) ),
inference(superposition,[status(thm)],[c_203,c_183]) ).
cnf(c_665,plain,
( unordered_pair(singleton(sK0(sK2(sK7))),unordered_pair(sK0(sK2(sK7)),sK1(sK2(sK7)))) = sK2(sK7)
| empty(sK7) ),
inference(superposition,[status(thm)],[c_70,c_620]) ).
cnf(c_687,plain,
( unordered_pair(singleton(sK0(sK2(sK7))),unordered_pair(sK0(sK2(sK7)),sK1(sK2(sK7)))) = sK2(sK7)
| empty_set = sK7 ),
inference(superposition,[status(thm)],[c_665,c_71]) ).
cnf(c_689,plain,
unordered_pair(singleton(sK0(sK2(sK7))),unordered_pair(sK0(sK2(sK7)),sK1(sK2(sK7)))) = sK2(sK7),
inference(forward_subsumption_resolution,[status(thm)],[c_687,c_68]) ).
cnf(c_693,plain,
~ in(sK2(sK7),sK7),
inference(superposition,[status(thm)],[c_689,c_170]) ).
cnf(c_694,plain,
empty(sK7),
inference(superposition,[status(thm)],[c_203,c_693]) ).
cnf(c_698,plain,
empty_set = sK7,
inference(superposition,[status(thm)],[c_694,c_71]) ).
cnf(c_700,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_698,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n007.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 17:03:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.82/1.18 % SZS status Started for theBenchmark.p
% 1.82/1.18 % SZS status Theorem for theBenchmark.p
% 1.82/1.18
% 1.82/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.82/1.18
% 1.82/1.18 ------ iProver source info
% 1.82/1.18
% 1.82/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.82/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.82/1.18 git: non_committed_changes: false
% 1.82/1.18 git: last_make_outside_of_git: false
% 1.82/1.18
% 1.82/1.18 ------ Parsing...
% 1.82/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.82/1.18
% 1.82/1.18 ------ Preprocessing... sup_sim: 2 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.82/1.18
% 1.82/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.82/1.18
% 1.82/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.82/1.18 ------ Proving...
% 1.82/1.18 ------ Problem Properties
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18 clauses 21
% 1.82/1.18 conjectures 2
% 1.82/1.18 EPR 15
% 1.82/1.18 Horn 20
% 1.82/1.18 unary 14
% 1.82/1.18 binary 5
% 1.82/1.18 lits 30
% 1.82/1.18 lits eq 5
% 1.82/1.18 fd_pure 0
% 1.82/1.18 fd_pseudo 0
% 1.82/1.18 fd_cond 1
% 1.82/1.18 fd_pseudo_cond 1
% 1.82/1.18 AC symbols 0
% 1.82/1.18
% 1.82/1.18 ------ Schedule dynamic 5 is on
% 1.82/1.18
% 1.82/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18 ------
% 1.82/1.18 Current options:
% 1.82/1.18 ------
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18 ------ Proving...
% 1.82/1.18
% 1.82/1.18
% 1.82/1.18 % SZS status Theorem for theBenchmark.p
% 1.82/1.18
% 1.82/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.82/1.18
% 1.82/1.18
%------------------------------------------------------------------------------