TSTP Solution File: NUM405+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM405+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n031.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 May 1 03:30:45 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 4 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 103 ( 40 ~; 40 |; 15 &)
% ( 2 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 46 ( 37 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,plain,
$false,
inference(subsumption_resolution,[],[f85,f87]) ).
fof(f87,plain,
ordinal(sK1(sK2(sK0))),
inference(unit_resulting_resolution,[],[f79,f52]) ).
fof(f52,plain,
! [X2,X0] :
( ~ in(X2,sK2(X0))
| ordinal(X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X2] :
( ( in(X2,sK2(X0))
| ~ ordinal(X2)
| ~ in(X2,X0) )
& ( ( ordinal(X2)
& in(X2,X0) )
| ~ in(X2,sK2(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f45,f46]) ).
fof(f46,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( in(X2,X1)
| ~ ordinal(X2)
| ~ in(X2,X0) )
& ( ( ordinal(X2)
& in(X2,X0) )
| ~ in(X2,X1) ) )
=> ! [X2] :
( ( in(X2,sK2(X0))
| ~ ordinal(X2)
| ~ in(X2,X0) )
& ( ( ordinal(X2)
& in(X2,X0) )
| ~ in(X2,sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0] :
? [X1] :
! [X2] :
( ( in(X2,X1)
| ~ ordinal(X2)
| ~ in(X2,X0) )
& ( ( ordinal(X2)
& in(X2,X0) )
| ~ in(X2,X1) ) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0] :
? [X1] :
! [X2] :
( ( in(X2,X1)
| ~ ordinal(X2)
| ~ in(X2,X0) )
& ( ( ordinal(X2)
& in(X2,X0) )
| ~ in(X2,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.Y0zSuVxwBG/Vampire---4.8_1281',s1_xboole_0__e2_43__ordinal1) ).
fof(f79,plain,
in(sK1(sK2(sK0)),sK2(sK0)),
inference(subsumption_resolution,[],[f72,f49]) ).
fof(f49,plain,
! [X0] :
( ordinal(sK1(X0))
| in(sK1(X0),X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0] :
( ( ~ ordinal(sK1(X0))
| ~ in(sK1(X0),X0) )
& ( ordinal(sK1(X0))
| in(sK1(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f41,f42]) ).
fof(f42,plain,
! [X0] :
( ? [X1] :
( ( ~ ordinal(X1)
| ~ in(X1,X0) )
& ( ordinal(X1)
| in(X1,X0) ) )
=> ( ( ~ ordinal(sK1(X0))
| ~ in(sK1(X0),X0) )
& ( ordinal(sK1(X0))
| in(sK1(X0),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0] :
? [X1] :
( ( ~ ordinal(X1)
| ~ in(X1,X0) )
& ( ordinal(X1)
| in(X1,X0) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
? [X1] :
( in(X1,X0)
<~> ordinal(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0] :
~ ! [X1] :
( in(X1,X0)
<=> ordinal(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Y0zSuVxwBG/Vampire---4.8_1281',t37_ordinal1) ).
fof(f72,plain,
( in(sK1(sK2(sK0)),sK2(sK0))
| ~ ordinal(sK1(sK2(sK0))) ),
inference(resolution,[],[f67,f50]) ).
fof(f50,plain,
! [X0] :
( ~ in(sK1(X0),X0)
| ~ ordinal(sK1(X0)) ),
inference(cnf_transformation,[],[f43]) ).
fof(f67,plain,
! [X0] :
( in(sK1(X0),sK2(sK0))
| in(sK1(X0),X0) ),
inference(duplicate_literal_removal,[],[f65]) ).
fof(f65,plain,
! [X0] :
( in(sK1(X0),sK2(sK0))
| in(sK1(X0),X0)
| in(sK1(X0),X0) ),
inference(resolution,[],[f59,f55]) ).
fof(f55,plain,
! [X0] :
( in(sK1(X0),sK0)
| in(sK1(X0),X0) ),
inference(resolution,[],[f49,f48]) ).
fof(f48,plain,
! [X1] :
( ~ ordinal(X1)
| in(X1,sK0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X1] :
( in(X1,sK0)
| ~ ordinal(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f36,f39]) ).
fof(f39,plain,
( ? [X0] :
! [X1] :
( in(X1,X0)
| ~ ordinal(X1) )
=> ! [X1] :
( in(X1,sK0)
| ~ ordinal(X1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
? [X0] :
! [X1] :
( in(X1,X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,negated_conjecture,
~ ! [X0] :
~ ! [X1] :
( ordinal(X1)
=> in(X1,X0) ),
inference(negated_conjecture,[],[f30]) ).
fof(f30,conjecture,
! [X0] :
~ ! [X1] :
( ordinal(X1)
=> in(X1,X0) ),
file('/export/starexec/sandbox/tmp/tmp.Y0zSuVxwBG/Vampire---4.8_1281',t38_ordinal1) ).
fof(f59,plain,
! [X0,X1] :
( ~ in(sK1(X0),X1)
| in(sK1(X0),sK2(X1))
| in(sK1(X0),X0) ),
inference(resolution,[],[f53,f49]) ).
fof(f53,plain,
! [X2,X0] :
( ~ ordinal(X2)
| in(X2,sK2(X0))
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f85,plain,
~ ordinal(sK1(sK2(sK0))),
inference(unit_resulting_resolution,[],[f79,f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM405+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n031.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 17:26:44 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Y0zSuVxwBG/Vampire---4.8_1281
% 0.61/0.79 % (1399)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.79 % (1398)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (1400)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.79 % (1401)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.79 % (1403)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.79 % (1402)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (1404)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.79 % (1405)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.79 % (1402)Refutation not found, incomplete strategy% (1402)------------------------------
% 0.61/0.79 % (1402)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (1401)First to succeed.
% 0.61/0.79 % (1402)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (1402)Memory used [KB]: 1056
% 0.61/0.79 % (1402)Time elapsed: 0.003 s
% 0.61/0.79 % (1402)Instructions burned: 3 (million)
% 0.61/0.79 % (1402)------------------------------
% 0.61/0.79 % (1402)------------------------------
% 0.61/0.79 % (1403)Refutation not found, incomplete strategy% (1403)------------------------------
% 0.61/0.79 % (1403)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (1403)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (1403)Memory used [KB]: 974
% 0.61/0.79 % (1403)Time elapsed: 0.004 s
% 0.61/0.79 % (1403)Instructions burned: 2 (million)
% 0.61/0.79 % (1403)------------------------------
% 0.61/0.79 % (1403)------------------------------
% 0.61/0.79 % (1400)Also succeeded, but the first one will report.
% 0.61/0.80 % (1401)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (1401)------------------------------
% 0.61/0.80 % (1401)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (1401)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (1401)Memory used [KB]: 983
% 0.61/0.80 % (1401)Time elapsed: 0.004 s
% 0.61/0.80 % (1401)Instructions burned: 4 (million)
% 0.61/0.80 % (1401)------------------------------
% 0.61/0.80 % (1401)------------------------------
% 0.61/0.80 % (1391)Success in time 0.482 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------