TSTP Solution File: SET074+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET074+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:06:12 EDT 2023
% Result : Theorem 1.88s 1.15s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 53 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 51 ( 19 ~; 15 |; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 2 sgn; 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f16,axiom,
! [X0] : ~ member(X0,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_defn) ).
fof(f44,conjecture,
! [X0,X1] :
( member(X1,universal_class)
=> unordered_pair(X0,X1) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary1_2) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( member(X1,universal_class)
=> unordered_pair(X0,X1) != null_class ),
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,X1] :
( unordered_pair(X0,X1) = null_class
& member(X1,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,X1] :
( unordered_pair(X0,X1) = null_class
& member(X1,universal_class) )
=> ( null_class = unordered_pair(sK6,sK7)
& member(sK7,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( null_class = unordered_pair(sK6,sK7)
& member(sK7,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[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(f166,plain,
! [X0] : ~ member(X0,null_class),
inference(cnf_transformation,[],[f16]) ).
fof(f222,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
null_class = unordered_pair(sK6,sK7),
inference(cnf_transformation,[],[f134]) ).
fof(f263,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,[],[f263]) ).
cnf(c_77,plain,
~ member(X0,null_class),
inference(cnf_transformation,[],[f166]) ).
cnf(c_128,negated_conjecture,
unordered_pair(sK6,sK7) = null_class,
inference(cnf_transformation,[],[f223]) ).
cnf(c_129,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f222]) ).
cnf(c_2464,plain,
( ~ member(sK7,universal_class)
| member(sK7,null_class) ),
inference(superposition,[status(thm)],[c_128,c_56]) ).
cnf(c_2465,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2464,c_77,c_129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET074+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 09:42:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.88/1.15 % SZS status Started for theBenchmark.p
% 1.88/1.15 % SZS status Theorem for theBenchmark.p
% 1.88/1.15
% 1.88/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.88/1.15
% 1.88/1.15 ------ iProver source info
% 1.88/1.15
% 1.88/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.88/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.88/1.15 git: non_committed_changes: false
% 1.88/1.15 git: last_make_outside_of_git: false
% 1.88/1.15
% 1.88/1.15 ------ Parsing...
% 1.88/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.88/1.15
% 1.88/1.15 ------ 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
% 1.88/1.15
% 1.88/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.88/1.15
% 1.88/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.15 ------ Proving...
% 1.88/1.15 ------ Problem Properties
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15 clauses 76
% 1.88/1.15 conjectures 2
% 1.88/1.15 EPR 8
% 1.88/1.15 Horn 68
% 1.88/1.15 unary 16
% 1.88/1.15 binary 39
% 1.88/1.15 lits 158
% 1.88/1.15 lits eq 15
% 1.88/1.15 fd_pure 0
% 1.88/1.15 fd_pseudo 0
% 1.88/1.15 fd_cond 4
% 1.88/1.15 fd_pseudo_cond 3
% 1.88/1.15 AC symbols 0
% 1.88/1.15
% 1.88/1.15 ------ Schedule dynamic 5 is on
% 1.88/1.15
% 1.88/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15 ------
% 1.88/1.15 Current options:
% 1.88/1.15 ------
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15 ------ Proving...
% 1.88/1.15
% 1.88/1.15
% 1.88/1.15 % SZS status Theorem for theBenchmark.p
% 1.88/1.15
% 1.88/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.15
% 1.88/1.15
%------------------------------------------------------------------------------