TSTP Solution File: SET687+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET687+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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 : Mon Jun 24 14:35:25 EDT 2024
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 16 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 23 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f12,conjecture,
! [X0] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI01) ).
fof(f13,negated_conjecture,
~ ! [X0] : subset(X0,X0),
inference(negated_conjecture,[],[f12]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f25,plain,
? [X0] : ~ subset(X0,X0),
inference(ennf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f27,f28]) ).
fof(f48,plain,
( ? [X0] : ~ subset(X0,X0)
=> ~ subset(sK3,sK3) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
~ subset(sK3,sK3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f48]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f76,plain,
~ subset(sK3,sK3),
inference(cnf_transformation,[],[f49]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_75,negated_conjecture,
~ subset(sK3,sK3),
inference(cnf_transformation,[],[f76]) ).
cnf(c_80,plain,
( member(sK0(sK3,sK3),sK3)
| subset(sK3,sK3) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_86,plain,
( ~ member(sK0(sK3,sK3),sK3)
| subset(sK3,sK3) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_87,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_86,c_80,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET687+4 : TPTP v8.2.0. Released v2.2.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Jun 23 14:36:54 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-06-12 09:56:46 +0000
% 0.46/1.15 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing...
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------