TSTP Solution File: SET062+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET062+4 : TPTP v8.1.2. Released v2.2.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 : Fri May 3 02:59:37 EDT 2024
% Result : Theorem 0.82s 1.19s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 53 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 54 ( 25 ~; 16 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 1 sgn 24 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).
fof(f12,conjecture,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI15) ).
fof(f13,negated_conjecture,
~ ! [X0] : subset(empty_set,X0),
inference(negated_conjecture,[],[f12]) ).
fof(f17,plain,
! [X0] : ~ member(X0,empty_set),
inference(rectify,[],[f6]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f25,plain,
? [X0] : ~ subset(empty_set,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(empty_set,X0)
=> ~ subset(empty_set,sK3) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
~ subset(empty_set,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(f61,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f76,plain,
~ subset(empty_set,sK3),
inference(cnf_transformation,[],[f49]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_60,plain,
~ member(X0,empty_set),
inference(cnf_transformation,[],[f61]) ).
cnf(c_75,negated_conjecture,
~ subset(empty_set,sK3),
inference(cnf_transformation,[],[f76]) ).
cnf(c_100,plain,
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_101,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_100]) ).
cnf(c_463,plain,
( X0 != empty_set
| X1 != sK3
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_101,c_75]) ).
cnf(c_464,plain,
member(sK0(empty_set,sK3),empty_set),
inference(unflattening,[status(thm)],[c_463]) ).
cnf(c_467,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_464,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET062+4 : TPTP v8.1.2. Released v2.2.0.
% 0.11/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 : Thu May 2 21:01:45 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.82/1.19 % SZS status Started for theBenchmark.p
% 0.82/1.19 % SZS status Theorem for theBenchmark.p
% 0.82/1.19
% 0.82/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.82/1.19
% 0.82/1.19 ------ iProver source info
% 0.82/1.19
% 0.82/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.82/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.82/1.19 git: non_committed_changes: false
% 0.82/1.19
% 0.82/1.19 ------ Parsing...
% 0.82/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.82/1.19
% 0.82/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s
% 0.82/1.19
% 0.82/1.19 % SZS status Theorem for theBenchmark.p
% 0.82/1.19
% 0.82/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.82/1.19
% 0.82/1.19
%------------------------------------------------------------------------------