TSTP Solution File: NUM540+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM540+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:18 EDT 2023
% Result : Theorem 1.12s 1.12s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 35 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 3 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 16 ( 1 sgn; 8 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,conjecture,
( ( ! [X0] : ~ aElementOf0(X0,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) )
=> ( slcrc0 = slbdtrb0(sz00)
| ~ ? [X0] : aElementOf0(X0,slbdtrb0(sz00)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f53,negated_conjecture,
~ ( ( ! [X0] : ~ aElementOf0(X0,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) )
=> ( slcrc0 = slbdtrb0(sz00)
| ~ ? [X0] : aElementOf0(X0,slbdtrb0(sz00)) ) ),
inference(negated_conjecture,[],[f52]) ).
fof(f60,plain,
~ ( ( ! [X0] : ~ aElementOf0(X0,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) )
=> ( slcrc0 = slbdtrb0(sz00)
| ~ ? [X1] : aElementOf0(X1,slbdtrb0(sz00)) ) ),
inference(rectify,[],[f53]) ).
fof(f128,plain,
( slcrc0 != slbdtrb0(sz00)
& ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
& ! [X0] : ~ aElementOf0(X0,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f129,plain,
( slcrc0 != slbdtrb0(sz00)
& ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
& ! [X0] : ~ aElementOf0(X0,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) ),
inference(flattening,[],[f128]) ).
fof(f180,plain,
( slcrc0 != slbdtrb0(sz00)
& ? [X0] : aElementOf0(X0,slbdtrb0(sz00))
& ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) ),
inference(rectify,[],[f129]) ).
fof(f181,plain,
( ? [X0] : aElementOf0(X0,slbdtrb0(sz00))
=> aElementOf0(sK13,slbdtrb0(sz00)) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
( slcrc0 != slbdtrb0(sz00)
& aElementOf0(sK13,slbdtrb0(sz00))
& ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00))
& aSet0(slbdtrb0(sz00)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f180,f181]) ).
fof(f274,plain,
! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00)),
inference(cnf_transformation,[],[f182]) ).
fof(f275,plain,
aElementOf0(sK13,slbdtrb0(sz00)),
inference(cnf_transformation,[],[f182]) ).
cnf(c_140,negated_conjecture,
aElementOf0(sK13,slbdtrb0(sz00)),
inference(cnf_transformation,[],[f275]) ).
cnf(c_141,negated_conjecture,
~ aElementOf0(X0,slbdtrb0(sz00)),
inference(cnf_transformation,[],[f274]) ).
cnf(c_232,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_140,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM540+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.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 : Fri Aug 25 16:25:56 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.12/1.12 % SZS status Started for theBenchmark.p
% 1.12/1.12 % SZS status Theorem for theBenchmark.p
% 1.12/1.12
% 1.12/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.12/1.12
% 1.12/1.12 ------ iProver source info
% 1.12/1.12
% 1.12/1.12 git: date: 2023-05-31 18:12:56 +0000
% 1.12/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.12/1.12 git: non_committed_changes: false
% 1.12/1.12 git: last_make_outside_of_git: false
% 1.12/1.12
% 1.12/1.12 ------ Parsing...
% 1.12/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.12/1.12
% 1.12/1.12 ------ Preprocessing...
% 1.12/1.12
% 1.12/1.12 % SZS status Theorem for theBenchmark.p
% 1.12/1.12
% 1.12/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.12/1.12
% 1.12/1.12
%------------------------------------------------------------------------------