TSTP Solution File: SET917+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET917+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 15:10:38 EDT 2023
% Result : Theorem 1.65s 1.14s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 39 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 18 ~; 8 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1] :
( in(X0,X1)
=> singleton(X0) = set_intersection2(X1,singleton(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1] :
( singleton(X0) = set_intersection2(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t58_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( singleton(X0) = set_intersection2(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[],[f9]) ).
fof(f13,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( singleton(X0) = set_intersection2(X1,singleton(X0))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f16,plain,
? [X0,X1] :
( singleton(X0) != set_intersection2(singleton(X0),X1)
& ~ disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f21,plain,
( ? [X0,X1] :
( singleton(X0) != set_intersection2(singleton(X0),X1)
& ~ disjoint(singleton(X0),X1) )
=> ( singleton(sK2) != set_intersection2(singleton(sK2),sK3)
& ~ disjoint(singleton(sK2),sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( singleton(sK2) != set_intersection2(singleton(sK2),sK3)
& ~ disjoint(singleton(sK2),sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f16,f21]) ).
fof(f24,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f26,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0,X1] :
( singleton(X0) = set_intersection2(X1,singleton(X0))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
~ disjoint(singleton(sK2),sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f32,plain,
singleton(sK2) != set_intersection2(singleton(sK2),sK3),
inference(cnf_transformation,[],[f22]) ).
cnf(c_50,plain,
set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f24]) ).
cnf(c_52,plain,
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_53,plain,
( ~ in(X0,X1)
| set_intersection2(X1,singleton(X0)) = singleton(X0) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_57,negated_conjecture,
set_intersection2(singleton(sK2),sK3) != singleton(sK2),
inference(cnf_transformation,[],[f32]) ).
cnf(c_58,negated_conjecture,
~ disjoint(singleton(sK2),sK3),
inference(cnf_transformation,[],[f31]) ).
cnf(c_101,plain,
set_intersection2(sK3,singleton(sK2)) != singleton(sK2),
inference(demodulation,[status(thm)],[c_57,c_50]) ).
cnf(c_281,plain,
in(sK2,sK3),
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_304,plain,
set_intersection2(sK3,singleton(sK2)) = singleton(sK2),
inference(superposition,[status(thm)],[c_281,c_53]) ).
cnf(c_305,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_304,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET917+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 12:22:15 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.65/1.14 % SZS status Started for theBenchmark.p
% 1.65/1.14 % SZS status Theorem for theBenchmark.p
% 1.65/1.14
% 1.65/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.65/1.14
% 1.65/1.14 ------ iProver source info
% 1.65/1.14
% 1.65/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.65/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.65/1.14 git: non_committed_changes: false
% 1.65/1.14 git: last_make_outside_of_git: false
% 1.65/1.14
% 1.65/1.14 ------ Parsing...
% 1.65/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.65/1.14
% 1.65/1.14 ------ Preprocessing... sup_sim: 1 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.65/1.14
% 1.65/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.65/1.14
% 1.65/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.65/1.14 ------ Proving...
% 1.65/1.14 ------ Problem Properties
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14 clauses 9
% 1.65/1.14 conjectures 1
% 1.65/1.14 EPR 3
% 1.65/1.14 Horn 8
% 1.65/1.14 unary 5
% 1.65/1.14 binary 4
% 1.65/1.14 lits 13
% 1.65/1.14 lits eq 5
% 1.65/1.14 fd_pure 0
% 1.65/1.14 fd_pseudo 0
% 1.65/1.14 fd_cond 0
% 1.65/1.14 fd_pseudo_cond 0
% 1.65/1.14 AC symbols 0
% 1.65/1.14
% 1.65/1.14 ------ Schedule dynamic 5 is on
% 1.65/1.14
% 1.65/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14 ------
% 1.65/1.14 Current options:
% 1.65/1.14 ------
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14 ------ Proving...
% 1.65/1.14
% 1.65/1.14
% 1.65/1.14 % SZS status Theorem for theBenchmark.p
% 1.65/1.14
% 1.65/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.14
% 1.65/1.14
%------------------------------------------------------------------------------