TSTP Solution File: SET927+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET927+1 : TPTP v8.1.2. Released v3.2.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:10:41 EDT 2023
% Result : Theorem 1.82s 1.10s
% Output : CNFRefutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 7 unt; 0 def)
% Number of atoms : 148 ( 76 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 171 ( 68 ~; 72 |; 25 &)
% ( 3 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 1 sgn; 35 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t70_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l39_zfmisc_1) ).
fof(f8,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<~> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
( ? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) )
=> ( ( ( sK2 != sK3
& ~ in(sK3,sK4) )
| in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2) )
& ( ( ( sK2 = sK3
| in(sK3,sK4) )
& ~ in(sK2,sK4) )
| set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ( ( sK2 != sK3
& ~ in(sK3,sK4) )
| in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2) )
& ( ( ( sK2 = sK3
| in(sK3,sK4) )
& ~ in(sK2,sK4) )
| set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f15,f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(flattening,[],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
( sK2 = sK3
| in(sK3,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
( ~ in(sK3,sK4)
| in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f27,plain,
( sK2 != sK3
| in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X2,X0,X1] :
( X0 = X1
| in(X1,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ~ in(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| X0 != X1
| in(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
! [X2,X1] :
( set_difference(unordered_pair(X1,X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(equality_resolution,[],[f31]) ).
cnf(c_50,plain,
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,negated_conjecture,
( set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2)
| sK2 != sK3
| in(sK2,sK4) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_54,negated_conjecture,
( set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2)
| ~ in(sK3,sK4)
| in(sK2,sK4) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_55,negated_conjecture,
( set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2)
| sK2 = sK3
| in(sK3,sK4) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,negated_conjecture,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,plain,
( set_difference(unordered_pair(X0,X0),X1) = singleton(X0)
| in(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_58,plain,
( ~ in(X0,X1)
| set_difference(unordered_pair(X2,X0),X1) = singleton(X2)
| in(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,plain,
( set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
| X0 = X1
| in(X1,X2) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_60,plain,
( set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_81,plain,
~ in(sK2,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_56,c_60]) ).
cnf(c_85,plain,
( set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2)
| ~ in(sK3,sK4) ),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_81]) ).
cnf(c_86,plain,
( set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2)
| sK2 != sK3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_81]) ).
cnf(c_102,plain,
( sK2 = sK3
| in(sK3,sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_55,c_59]) ).
cnf(c_168,plain,
set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2),
inference(global_subsumption_just,[status(thm)],[c_86,c_54,c_53,c_81,c_102]) ).
cnf(c_170,plain,
set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2),
inference(global_subsumption_just,[status(thm)],[c_85,c_168]) ).
cnf(c_465,plain,
( ~ in(sK4,sK3)
| sK2 = sK3 ),
inference(superposition,[status(thm)],[c_102,c_50]) ).
cnf(c_477,plain,
set_difference(unordered_pair(sK2,sK2),sK4) = singleton(sK2),
inference(superposition,[status(thm)],[c_57,c_81]) ).
cnf(c_478,plain,
( set_difference(unordered_pair(sK4,sK4),sK3) = singleton(sK4)
| sK2 = sK3 ),
inference(superposition,[status(thm)],[c_57,c_465]) ).
cnf(c_499,plain,
( set_difference(unordered_pair(X0,sK3),sK4) = singleton(X0)
| sK2 = sK3
| in(X0,sK4) ),
inference(superposition,[status(thm)],[c_102,c_58]) ).
cnf(c_506,plain,
( set_difference(unordered_pair(sK2,sK3),sK4) = singleton(sK2)
| sK2 = sK3
| in(sK2,sK4) ),
inference(instantiation,[status(thm)],[c_499]) ).
cnf(c_528,plain,
sK2 = sK3,
inference(global_subsumption_just,[status(thm)],[c_478,c_54,c_53,c_81,c_102,c_506]) ).
cnf(c_531,plain,
set_difference(unordered_pair(sK2,sK2),sK4) != singleton(sK2),
inference(demodulation,[status(thm)],[c_170,c_528]) ).
cnf(c_532,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_531,c_477]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET927+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n016.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sat Aug 26 15:58:42 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.82/1.10 % SZS status Started for theBenchmark.p
% 1.82/1.10 % SZS status Theorem for theBenchmark.p
% 1.82/1.10
% 1.82/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.82/1.10
% 1.82/1.10 ------ iProver source info
% 1.82/1.10
% 1.82/1.10 git: date: 2023-05-31 18:12:56 +0000
% 1.82/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.82/1.10 git: non_committed_changes: false
% 1.82/1.10 git: last_make_outside_of_git: false
% 1.82/1.10
% 1.82/1.10 ------ Parsing...
% 1.82/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.82/1.10
% 1.82/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.82/1.10
% 1.82/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.82/1.10
% 1.82/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.82/1.10 ------ Proving...
% 1.82/1.10 ------ Problem Properties
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10 clauses 10
% 1.82/1.10 conjectures 0
% 1.82/1.10 EPR 4
% 1.82/1.10 Horn 6
% 1.82/1.10 unary 4
% 1.82/1.10 binary 4
% 1.82/1.10 lits 18
% 1.82/1.10 lits eq 9
% 1.82/1.10 fd_pure 0
% 1.82/1.10 fd_pseudo 0
% 1.82/1.10 fd_cond 0
% 1.82/1.10 fd_pseudo_cond 1
% 1.82/1.10 AC symbols 0
% 1.82/1.10
% 1.82/1.10 ------ Schedule dynamic 5 is on
% 1.82/1.10
% 1.82/1.10 ------ no conjectures: strip conj schedule
% 1.82/1.10
% 1.82/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10 ------
% 1.82/1.10 Current options:
% 1.82/1.10 ------
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10 ------ Proving...
% 1.82/1.10
% 1.82/1.10
% 1.82/1.10 % SZS status Theorem for theBenchmark.p
% 1.82/1.10
% 1.82/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.82/1.10
% 1.82/1.10
%------------------------------------------------------------------------------