TSTP Solution File: SET907+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET907+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:34 EDT 2023
% Result : Theorem 1.75s 1.17s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 69 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 26 ~; 17 |; 17 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn; 28 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f10,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f11,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_zfmisc_1) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
inference(negated_conjecture,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
? [X0,X1,X2] :
( set_union2(unordered_pair(X0,X2),X1) != X1
& in(X2,X1)
& in(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f21,plain,
? [X0,X1,X2] :
( set_union2(unordered_pair(X0,X2),X1) != X1
& in(X2,X1)
& in(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( set_union2(unordered_pair(X0,X2),X1) != X1
& in(X2,X1)
& in(X0,X1) )
=> ( sK3 != set_union2(unordered_pair(sK2,sK4),sK3)
& in(sK4,sK3)
& in(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( sK3 != set_union2(unordered_pair(sK2,sK4),sK3)
& in(sK4,sK3)
& in(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f21,f28]) ).
fof(f32,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f39,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
in(sK2,sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f44,plain,
in(sK4,sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f45,plain,
sK3 != set_union2(unordered_pair(sK2,sK4),sK3),
inference(cnf_transformation,[],[f29]) ).
cnf(c_51,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f32]) ).
cnf(c_58,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_59,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| subset(unordered_pair(X2,X0),X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_62,negated_conjecture,
set_union2(unordered_pair(sK2,sK4),sK3) != sK3,
inference(cnf_transformation,[],[f45]) ).
cnf(c_63,negated_conjecture,
in(sK4,sK3),
inference(cnf_transformation,[],[f44]) ).
cnf(c_64,negated_conjecture,
in(sK2,sK3),
inference(cnf_transformation,[],[f43]) ).
cnf(c_130,plain,
set_union2(sK3,unordered_pair(sK2,sK4)) != sK3,
inference(demodulation,[status(thm)],[c_62,c_51]) ).
cnf(c_466,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| set_union2(unordered_pair(X2,X0),X1) = X1 ),
inference(superposition,[status(thm)],[c_59,c_58]) ).
cnf(c_478,plain,
( ~ in(X0,sK3)
| set_union2(unordered_pair(X0,sK4),sK3) = sK3 ),
inference(superposition,[status(thm)],[c_63,c_466]) ).
cnf(c_491,plain,
( ~ in(X0,sK3)
| set_union2(sK3,unordered_pair(X0,sK4)) = sK3 ),
inference(demodulation,[status(thm)],[c_478,c_51]) ).
cnf(c_497,plain,
set_union2(sK3,unordered_pair(sK2,sK4)) = sK3,
inference(superposition,[status(thm)],[c_64,c_491]) ).
cnf(c_498,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_497,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET907+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 09:21:30 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.75/1.17 % SZS status Started for theBenchmark.p
% 1.75/1.17 % SZS status Theorem for theBenchmark.p
% 1.75/1.17
% 1.75/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.75/1.17
% 1.75/1.17 ------ iProver source info
% 1.75/1.17
% 1.75/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.75/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.75/1.17 git: non_committed_changes: false
% 1.75/1.17 git: last_make_outside_of_git: false
% 1.75/1.17
% 1.75/1.17 ------ Parsing...
% 1.75/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.75/1.17
% 1.75/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.75/1.17
% 1.75/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.17
% 1.75/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.75/1.17 ------ Proving...
% 1.75/1.17 ------ Problem Properties
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17 clauses 16
% 1.75/1.17 conjectures 2
% 1.75/1.17 EPR 6
% 1.75/1.17 Horn 16
% 1.75/1.17 unary 9
% 1.75/1.17 binary 6
% 1.75/1.17 lits 24
% 1.75/1.17 lits eq 5
% 1.75/1.17 fd_pure 0
% 1.75/1.17 fd_pseudo 0
% 1.75/1.17 fd_cond 0
% 1.75/1.17 fd_pseudo_cond 0
% 1.75/1.17 AC symbols 0
% 1.75/1.17
% 1.75/1.17 ------ Schedule dynamic 5 is on
% 1.75/1.17
% 1.75/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17 ------
% 1.75/1.17 Current options:
% 1.75/1.17 ------
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17 ------ Proving...
% 1.75/1.17
% 1.75/1.17
% 1.75/1.17 % SZS status Theorem for theBenchmark.p
% 1.75/1.17
% 1.75/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.17
% 1.75/1.17
%------------------------------------------------------------------------------