TSTP Solution File: SET117+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET117+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:06:38 EDT 2023
% Result : Theorem 0.57s 1.24s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 15 unt; 0 def)
% Number of atoms : 27 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn; 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_1_to_ordered_pairs_are_sets) ).
fof(f45,negated_conjecture,
~ ! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
inference(negated_conjecture,[],[f44]) ).
fof(f84,plain,
? [X0] :
( ~ member(X0,universal_class)
& ordered_pair(first(X0),second(X0)) = X0 ),
inference(ennf_transformation,[],[f45]) ).
fof(f133,plain,
( ? [X0] :
( ~ member(X0,universal_class)
& ordered_pair(first(X0),second(X0)) = X0 )
=> ( ~ member(sK6,universal_class)
& sK6 = ordered_pair(first(sK6),second(sK6)) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ~ member(sK6,universal_class)
& sK6 = ordered_pair(first(sK6),second(sK6)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f84,f133]) ).
fof(f146,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f147,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f148,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f222,plain,
sK6 = ordered_pair(first(sK6),second(sK6)),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f134]) ).
fof(f224,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f148,f147,f147]) ).
fof(f261,plain,
sK6 = unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))),
inference(definition_unfolding,[],[f222,f224]) ).
cnf(c_60,plain,
member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f146]) ).
cnf(c_128,negated_conjecture,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f223]) ).
cnf(c_129,negated_conjecture,
unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))) = sK6,
inference(cnf_transformation,[],[f261]) ).
cnf(c_2362,plain,
member(sK6,universal_class),
inference(superposition,[status(thm)],[c_129,c_60]) ).
cnf(c_2363,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2362,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET117+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 10:54:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.57/1.24 % SZS status Started for theBenchmark.p
% 0.57/1.24 % SZS status Theorem for theBenchmark.p
% 0.57/1.24
% 0.57/1.24 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.57/1.24
% 0.57/1.24 ------ iProver source info
% 0.57/1.24
% 0.57/1.24 git: date: 2023-05-31 18:12:56 +0000
% 0.57/1.24 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.57/1.24 git: non_committed_changes: false
% 0.57/1.24 git: last_make_outside_of_git: false
% 0.57/1.24
% 0.57/1.24 ------ Parsing...
% 0.57/1.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.57/1.24
% 0.57/1.24 ------ 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
% 0.57/1.24
% 0.57/1.24 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.57/1.24
% 0.57/1.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.57/1.24 ------ Proving...
% 0.57/1.24 ------ Problem Properties
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24 clauses 76
% 0.57/1.24 conjectures 2
% 0.57/1.24 EPR 8
% 0.57/1.24 Horn 68
% 0.57/1.24 unary 16
% 0.57/1.24 binary 39
% 0.57/1.24 lits 158
% 0.57/1.24 lits eq 15
% 0.57/1.24 fd_pure 0
% 0.57/1.24 fd_pseudo 0
% 0.57/1.24 fd_cond 4
% 0.57/1.24 fd_pseudo_cond 3
% 0.57/1.24 AC symbols 0
% 0.57/1.24
% 0.57/1.24 ------ Schedule dynamic 5 is on
% 0.57/1.24
% 0.57/1.24 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24 ------
% 0.57/1.24 Current options:
% 0.57/1.24 ------
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24 ------ Proving...
% 0.57/1.24
% 0.57/1.24
% 0.57/1.24 % SZS status Theorem for theBenchmark.p
% 0.57/1.24
% 0.57/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.57/1.24
% 0.57/1.24
%------------------------------------------------------------------------------