TSTP Solution File: SET019+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET019+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:22 EDT 2024
% Result : Theorem 0.73s 1.12s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 52 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 12 |; 14 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f12,conjecture,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI02) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(negated_conjecture,[],[f12]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f25,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f26,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f28,plain,
? [X0,X1] :
( ~ equal_set(X0,X1)
& subset(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f29,plain,
? [X0,X1] :
( ~ equal_set(X0,X1)
& subset(X1,X0)
& subset(X0,X1) ),
inference(flattening,[],[f28]) ).
fof(f52,plain,
( ? [X0,X1] :
( ~ equal_set(X0,X1)
& subset(X1,X0)
& subset(X0,X1) )
=> ( ~ equal_set(sK3,sK4)
& subset(sK4,sK3)
& subset(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
( ~ equal_set(sK3,sK4)
& subset(sK4,sK3)
& subset(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f29,f52]) ).
fof(f57,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f81,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f53]) ).
fof(f82,plain,
subset(sK4,sK3),
inference(cnf_transformation,[],[f53]) ).
fof(f83,plain,
~ equal_set(sK3,sK4),
inference(cnf_transformation,[],[f53]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_76,negated_conjecture,
~ equal_set(sK3,sK4),
inference(cnf_transformation,[],[f83]) ).
cnf(c_77,negated_conjecture,
subset(sK4,sK3),
inference(cnf_transformation,[],[f82]) ).
cnf(c_78,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f81]) ).
cnf(c_434,plain,
( X0 != sK3
| X1 != sK4
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
cnf(c_435,plain,
( ~ subset(sK3,sK4)
| ~ subset(sK4,sK3) ),
inference(unflattening,[status(thm)],[c_434]) ).
cnf(c_436,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_435,c_77,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET019+4 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n021.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 20:43:58 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.73/1.12 % SZS status Started for theBenchmark.p
% 0.73/1.12 % SZS status Theorem for theBenchmark.p
% 0.73/1.12
% 0.73/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.73/1.12
% 0.73/1.12 ------ iProver source info
% 0.73/1.12
% 0.73/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.73/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.73/1.12 git: non_committed_changes: false
% 0.73/1.12
% 0.73/1.12 ------ Parsing...
% 0.73/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.73/1.12
% 0.73/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s
% 0.73/1.12
% 0.73/1.12 % SZS status Theorem for theBenchmark.p
% 0.73/1.12
% 0.73/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.12
% 0.73/1.12
%------------------------------------------------------------------------------