TSTP Solution File: SET024+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET024+1 : TPTP v8.1.2. Bugfixed v5.4.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 : Thu Aug 31 15:05:39 EDT 2023
% Result : Theorem 2.88s 1.05s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 52 ( 15 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 14 |; 12 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 1 sgn; 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f44,conjecture,
! [X0] :
( member(X0,universal_class)
=> member(X0,singleton(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_in_its_singleton) ).
fof(f45,negated_conjecture,
~ ! [X0] :
( member(X0,universal_class)
=> member(X0,singleton(X0)) ),
inference(negated_conjecture,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f84,plain,
? [X0] :
( ~ member(X0,singleton(X0))
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f91]) ).
fof(f133,plain,
( ? [X0] :
( ~ member(X0,singleton(X0))
& member(X0,universal_class) )
=> ( ~ member(sK6,singleton(sK6))
& member(sK6,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ~ member(sK6,singleton(sK6))
& member(sK6,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f84,f133]) ).
fof(f145,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f92]) ).
fof(f147,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f222,plain,
member(sK6,universal_class),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
~ member(sK6,singleton(sK6)),
inference(cnf_transformation,[],[f134]) ).
fof(f261,plain,
~ member(sK6,unordered_pair(sK6,sK6)),
inference(definition_unfolding,[],[f223,f147]) ).
fof(f264,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f145]) ).
cnf(c_56,plain,
( ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X0)) ),
inference(cnf_transformation,[],[f264]) ).
cnf(c_128,negated_conjecture,
~ member(sK6,unordered_pair(sK6,sK6)),
inference(cnf_transformation,[],[f261]) ).
cnf(c_129,negated_conjecture,
member(sK6,universal_class),
inference(cnf_transformation,[],[f222]) ).
cnf(c_2448,plain,
~ member(sK6,universal_class),
inference(superposition,[status(thm)],[c_56,c_128]) ).
cnf(c_2449,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2448,c_129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET024+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n016.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 : Sat Aug 26 12:05:57 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.88/1.05 % SZS status Started for theBenchmark.p
% 2.88/1.05 % SZS status Theorem for theBenchmark.p
% 2.88/1.05
% 2.88/1.05 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.88/1.05
% 2.88/1.05 ------ iProver source info
% 2.88/1.05
% 2.88/1.05 git: date: 2023-05-31 18:12:56 +0000
% 2.88/1.05 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.88/1.05 git: non_committed_changes: false
% 2.88/1.05 git: last_make_outside_of_git: false
% 2.88/1.05
% 2.88/1.05 ------ Parsing...
% 2.88/1.05 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.88/1.05
% 2.88/1.05 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 2.88/1.05
% 2.88/1.05 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.88/1.05
% 2.88/1.05 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.88/1.05 ------ Proving...
% 2.88/1.05 ------ Problem Properties
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05 clauses 76
% 2.88/1.05 conjectures 2
% 2.88/1.05 EPR 8
% 2.88/1.05 Horn 68
% 2.88/1.05 unary 16
% 2.88/1.05 binary 39
% 2.88/1.05 lits 158
% 2.88/1.05 lits eq 14
% 2.88/1.05 fd_pure 0
% 2.88/1.05 fd_pseudo 0
% 2.88/1.05 fd_cond 4
% 2.88/1.05 fd_pseudo_cond 3
% 2.88/1.05 AC symbols 0
% 2.88/1.05
% 2.88/1.05 ------ Schedule dynamic 5 is on
% 2.88/1.05
% 2.88/1.05 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05 ------
% 2.88/1.05 Current options:
% 2.88/1.05 ------
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05 ------ Proving...
% 2.88/1.05
% 2.88/1.05
% 2.88/1.05 % SZS status Theorem for theBenchmark.p
% 2.88/1.05
% 2.88/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.88/1.05
% 2.88/1.05
%------------------------------------------------------------------------------