TSTP Solution File: NUM533+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 11:31:13 EDT 2023
% Result : Theorem 1.58s 1.20s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 89 ( 26 ~; 15 |; 35 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn; 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,conjecture,
( ( aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xB)
=> aElementOf0(X0,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xC) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f16,negated_conjecture,
~ ( ( aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xB)
=> aElementOf0(X0,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xC) ) ) ),
inference(negated_conjecture,[],[f15]) ).
fof(f21,plain,
~ ( ( aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xB)
=> aElementOf0(X0,xC) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( aElementOf0(X1,xA)
=> aElementOf0(X1,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X2] :
( aElementOf0(X2,xA)
=> aElementOf0(X2,xC) ) ) ),
inference(rectify,[],[f16]) ).
fof(f32,plain,
( ~ aSubsetOf0(xA,xC)
& ? [X2] :
( ~ aElementOf0(X2,xC)
& aElementOf0(X2,xA) )
& aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xC)
| ~ aElementOf0(X0,xB) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
( ~ aSubsetOf0(xA,xC)
& ? [X2] :
( ~ aElementOf0(X2,xC)
& aElementOf0(X2,xA) )
& aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xC)
| ~ aElementOf0(X0,xB) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ) ),
inference(flattening,[],[f32]) ).
fof(f44,plain,
( ~ aSubsetOf0(xA,xC)
& ? [X0] :
( ~ aElementOf0(X0,xC)
& aElementOf0(X0,xA) )
& aSubsetOf0(xB,xC)
& ! [X1] :
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) )
& aSubsetOf0(xA,xB)
& ! [X2] :
( aElementOf0(X2,xB)
| ~ aElementOf0(X2,xA) ) ),
inference(rectify,[],[f33]) ).
fof(f45,plain,
( ? [X0] :
( ~ aElementOf0(X0,xC)
& aElementOf0(X0,xA) )
=> ( ~ aElementOf0(sK2,xC)
& aElementOf0(sK2,xA) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
( ~ aSubsetOf0(xA,xC)
& ~ aElementOf0(sK2,xC)
& aElementOf0(sK2,xA)
& aSubsetOf0(xB,xC)
& ! [X1] :
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) )
& aSubsetOf0(xA,xB)
& ! [X2] :
( aElementOf0(X2,xB)
| ~ aElementOf0(X2,xA) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f44,f45]) ).
fof(f61,plain,
! [X2] :
( aElementOf0(X2,xB)
| ~ aElementOf0(X2,xA) ),
inference(cnf_transformation,[],[f46]) ).
fof(f63,plain,
! [X1] :
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
inference(cnf_transformation,[],[f46]) ).
fof(f65,plain,
aElementOf0(sK2,xA),
inference(cnf_transformation,[],[f46]) ).
fof(f66,plain,
~ aElementOf0(sK2,xC),
inference(cnf_transformation,[],[f46]) ).
cnf(c_64,negated_conjecture,
~ aElementOf0(sK2,xC),
inference(cnf_transformation,[],[f66]) ).
cnf(c_65,negated_conjecture,
aElementOf0(sK2,xA),
inference(cnf_transformation,[],[f65]) ).
cnf(c_67,negated_conjecture,
( ~ aElementOf0(X0,xB)
| aElementOf0(X0,xC) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_69,negated_conjecture,
( ~ aElementOf0(X0,xA)
| aElementOf0(X0,xB) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_597,plain,
aElementOf0(sK2,xB),
inference(superposition,[status(thm)],[c_65,c_69]) ).
cnf(c_598,plain,
aElementOf0(sK2,xC),
inference(superposition,[status(thm)],[c_597,c_67]) ).
cnf(c_599,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_598,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 11:34:57 EDT 2023
% 0.14/0.34 % 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.58/1.20 % SZS status Started for theBenchmark.p
% 1.58/1.20 % SZS status Theorem for theBenchmark.p
% 1.58/1.20
% 1.58/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.58/1.20
% 1.58/1.20 ------ iProver source info
% 1.58/1.20
% 1.58/1.20 git: date: 2023-05-31 18:12:56 +0000
% 1.58/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.58/1.20 git: non_committed_changes: false
% 1.58/1.20 git: last_make_outside_of_git: false
% 1.58/1.20
% 1.58/1.20 ------ Parsing...
% 1.58/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.58/1.20
% 1.58/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.58/1.20
% 1.58/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.58/1.20
% 1.58/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.58/1.20 ------ Proving...
% 1.58/1.20 ------ Problem Properties
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20 clauses 19
% 1.58/1.20 conjectures 7
% 1.58/1.20 EPR 16
% 1.58/1.20 Horn 17
% 1.58/1.20 unary 10
% 1.58/1.20 binary 3
% 1.58/1.20 lits 38
% 1.58/1.20 lits eq 2
% 1.58/1.20 fd_pure 0
% 1.58/1.20 fd_pseudo 0
% 1.58/1.20 fd_cond 1
% 1.58/1.20 fd_pseudo_cond 1
% 1.58/1.20 AC symbols 0
% 1.58/1.20
% 1.58/1.20 ------ Schedule dynamic 5 is on
% 1.58/1.20
% 1.58/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20 ------
% 1.58/1.20 Current options:
% 1.58/1.20 ------
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20 ------ Proving...
% 1.58/1.20
% 1.58/1.20
% 1.58/1.20 % SZS status Theorem for theBenchmark.p
% 1.58/1.20
% 1.58/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.20
% 1.58/1.20
%------------------------------------------------------------------------------