TSTP Solution File: ITP010+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : ITP010+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n003.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 : Wed Aug 31 17:15:58 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 126 ( 35 ~; 24 |; 47 &)
% ( 3 <=>; 16 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 12 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f302,plain,
$false,
inference(subsumption_resolution,[],[f300,f301]) ).
fof(f301,plain,
p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)),
inference(duplicate_literal_removal,[],[f183]) ).
fof(f183,plain,
( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
( ne(sK7)
& mem(sK10,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) )
& mem(sK9,arr(sK7,bool))
& ne(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10])],[f127,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ne(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) )
& mem(X2,arr(X0,bool)) )
& ne(X1) ) )
=> ( ne(sK7)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3)) ) )
& mem(X2,arr(sK7,bool)) )
& ne(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,X1),X2),X3)) ) )
& mem(X2,arr(sK7,bool)) )
& ne(X1) )
=> ( ? [X2] :
( ? [X3] :
( mem(X3,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3)) ) )
& mem(X2,arr(sK7,bool)) )
& ne(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( mem(X3,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),X2),X3)) ) )
& mem(X2,arr(sK7,bool)) )
=> ( ? [X3] :
( mem(X3,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3)) ) )
& mem(sK9,arr(sK7,bool)) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( mem(X3,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),X3)) ) )
=> ( mem(sK10,arr(sK8,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ne(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) )
& mem(X2,arr(X0,bool)) )
& ne(X1) ) ),
inference(flattening,[],[f126]) ).
fof(f126,plain,
? [X0] :
( ne(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) )
& mem(X2,arr(X0,bool)) )
& ne(X1) ) ),
inference(nnf_transformation,[],[f93]) ).
fof(f93,plain,
? [X0] :
( ne(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( mem(X3,arr(X1,bool))
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
<~> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) )
& mem(X2,arr(X0,bool)) )
& ne(X1) ) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,plain,
~ ! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X0,bool))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) ) ) ) ),
inference(rectify,[],[f42]) ).
fof(f42,negated_conjecture,
~ ! [X8] :
( ne(X8)
=> ! [X9] :
( ne(X9)
=> ! [X13] :
( mem(X13,arr(X8,bool))
=> ! [X14] :
( mem(X14,arr(X9,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X13),X14))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X13),X14)) ) ) ) ) ),
inference(negated_conjecture,[],[f41]) ).
fof(f41,conjecture,
! [X8] :
( ne(X8)
=> ! [X9] :
( ne(X9)
=> ! [X13] :
( mem(X13,arr(X8,bool))
=> ! [X14] :
( mem(X14,arr(X9,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X13),X14))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X13),X14)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
fof(f300,plain,
~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)),
inference(duplicate_literal_removal,[],[f182]) ).
fof(f182,plain,
( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK7,sK8),sK9),sK10)) ),
inference(cnf_transformation,[],[f132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ITP010+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.33 % Computer : n003.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Aug 29 23:30:37 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.44 % (25152)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.44 % (25152)Instruction limit reached!
% 0.20/0.44 % (25152)------------------------------
% 0.20/0.44 % (25152)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.44 % (25152)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.44 % (25152)Termination reason: Unknown
% 0.20/0.44 % (25152)Termination phase: shuffling
% 0.20/0.44
% 0.20/0.44 % (25152)Memory used [KB]: 1535
% 0.20/0.44 % (25152)Time elapsed: 0.003 s
% 0.20/0.44 % (25152)Instructions burned: 4 (million)
% 0.20/0.44 % (25152)------------------------------
% 0.20/0.44 % (25152)------------------------------
% 0.20/0.49 % (25168)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.49 % (25168)Instruction limit reached!
% 0.20/0.49 % (25168)------------------------------
% 0.20/0.49 % (25168)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (25168)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (25168)Termination reason: Unknown
% 0.20/0.49 % (25168)Termination phase: Preprocessing 3
% 0.20/0.49
% 0.20/0.49 % (25168)Memory used [KB]: 1407
% 0.20/0.49 % (25168)Time elapsed: 0.004 s
% 0.20/0.49 % (25168)Instructions burned: 2 (million)
% 0.20/0.49 % (25168)------------------------------
% 0.20/0.49 % (25168)------------------------------
% 0.20/0.49 % (25160)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.50 % (25160)First to succeed.
% 0.20/0.50 % (25154)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50 % (25153)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (25160)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (25160)------------------------------
% 0.20/0.51 % (25160)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (25160)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (25160)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (25160)Memory used [KB]: 6140
% 0.20/0.51 % (25160)Time elapsed: 0.011 s
% 0.20/0.51 % (25160)Instructions burned: 6 (million)
% 0.20/0.51 % (25160)------------------------------
% 0.20/0.51 % (25160)------------------------------
% 0.20/0.51 % (25146)Success in time 0.161 s
%------------------------------------------------------------------------------