TSTP Solution File: SET691+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET691+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 03:01:15 EDT 2024
% Result : Theorem 0.71s 1.11s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 9 unt; 0 def)
% Number of atoms : 121 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 133 ( 57 ~; 50 |; 17 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 1 sgn 34 !; 6 ?)
% 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(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).
fof(f12,conjecture,
! [X0] :
( subset(X0,empty_set)
<=> equal_set(X0,empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI16) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( subset(X0,empty_set)
<=> equal_set(X0,empty_set) ),
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(X0,empty_set)
<~> equal_set(X0,empty_set) ),
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(f30,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f31,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f30]) ).
fof(f50,plain,
? [X0] :
( ( ~ equal_set(X0,empty_set)
| ~ subset(X0,empty_set) )
& ( equal_set(X0,empty_set)
| subset(X0,empty_set) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f51,plain,
( ? [X0] :
( ( ~ equal_set(X0,empty_set)
| ~ subset(X0,empty_set) )
& ( equal_set(X0,empty_set)
| subset(X0,empty_set) ) )
=> ( ( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) )
& ( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
( ( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) )
& ( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f50,f51]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f58,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f82,plain,
( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ),
inference(cnf_transformation,[],[f52]) ).
fof(f83,plain,
( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_54,plain,
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_63,plain,
~ member(X0,empty_set),
inference(cnf_transformation,[],[f67]) ).
cnf(c_78,negated_conjecture,
( ~ subset(sK3,empty_set)
| ~ equal_set(sK3,empty_set) ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_79,negated_conjecture,
( subset(sK3,empty_set)
| equal_set(sK3,empty_set) ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_102,plain,
( ~ equal_set(sK3,empty_set)
| ~ subset(sK3,empty_set) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_103,plain,
( ~ subset(sK3,empty_set)
| ~ equal_set(sK3,empty_set) ),
inference(renaming,[status(thm)],[c_102]) ).
cnf(c_104,plain,
( equal_set(sK3,empty_set)
| subset(sK3,empty_set) ),
inference(prop_impl_just,[status(thm)],[c_79]) ).
cnf(c_105,plain,
( subset(sK3,empty_set)
| equal_set(sK3,empty_set) ),
inference(renaming,[status(thm)],[c_104]) ).
cnf(c_110,plain,
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_111,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_110]) ).
cnf(c_112,plain,
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
cnf(c_113,plain,
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_112]) ).
cnf(c_225,plain,
subset(sK3,empty_set),
inference(forward_subsumption_resolution,[status(thm)],[c_105,c_113]) ).
cnf(c_229,plain,
~ equal_set(sK3,empty_set),
inference(backward_subsumption_resolution,[status(thm)],[c_103,c_225]) ).
cnf(c_472,plain,
( X0 != sK3
| X1 != empty_set
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_229]) ).
cnf(c_473,plain,
( ~ subset(empty_set,sK3)
| ~ subset(sK3,empty_set) ),
inference(unflattening,[status(thm)],[c_472]) ).
cnf(c_474,plain,
~ subset(empty_set,sK3),
inference(global_subsumption_just,[status(thm)],[c_473,c_225,c_473]) ).
cnf(c_552,plain,
( X0 != empty_set
| X1 != sK3
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_111,c_474]) ).
cnf(c_553,plain,
member(sK0(empty_set,sK3),empty_set),
inference(unflattening,[status(thm)],[c_552]) ).
cnf(c_556,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_553,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET691+4 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu May 2 20:29:08 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.71/1.11 % SZS status Started for theBenchmark.p
% 0.71/1.11 % SZS status Theorem for theBenchmark.p
% 0.71/1.11
% 0.71/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.71/1.11
% 0.71/1.11 ------ iProver source info
% 0.71/1.11
% 0.71/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.71/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.71/1.11 git: non_committed_changes: false
% 0.71/1.11
% 0.71/1.11 ------ Parsing...
% 0.71/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.71/1.11
% 0.71/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s
% 0.71/1.11
% 0.71/1.11 % SZS status Theorem for theBenchmark.p
% 0.71/1.11
% 0.71/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.11
% 0.71/1.11
%------------------------------------------------------------------------------