TSTP Solution File: SYN339+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN339+1 : TPTP v8.2.0. Released v2.0.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 : n005.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 : Tue May 21 08:21:53 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 19 ( 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,plain,
$false,
inference(resolution,[],[f7,f6]) ).
fof(f6,plain,
! [X2,X0] : big_f(X0,sK0(X0),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X0,X2] :
( ~ big_f(sK0(X0),X2,X2)
& big_f(X0,sK0(X0),X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).
fof(f4,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ~ big_f(X1,X2,X2)
& big_f(X0,X1,X2) )
=> ! [X2] :
( ~ big_f(sK0(X0),X2,X2)
& big_f(X0,sK0(X0),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f3,plain,
! [X0] :
? [X1] :
! [X2] :
( ~ big_f(X1,X2,X2)
& big_f(X0,X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
? [X2] :
( big_f(X0,X1,X2)
=> big_f(X1,X2,X2) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0] :
! [X1] :
? [X2] :
( big_f(X0,X1,X2)
=> big_f(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_15_4) ).
fof(f7,plain,
! [X2,X0] : ~ big_f(sK0(X0),X2,X2),
inference(cnf_transformation,[],[f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN339+1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 13:56:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.14/0.35 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/benchmark/theBenchmark.p
% 0.57/0.74 % (9624)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.57/0.74 % (9624)First to succeed.
% 0.57/0.74 % (9624)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9616"
% 0.57/0.74 % (9617)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 theBenchmark for (2996ds/34Mi)
% 0.57/0.74 % (9619)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.74 % (9618)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 theBenchmark for (2996ds/51Mi)
% 0.57/0.74 % (9621)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 theBenchmark for (2996ds/34Mi)
% 0.57/0.74 % (9622)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.57/0.74 % (9624)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for theBenchmark
% 0.57/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.74 % (9624)------------------------------
% 0.57/0.74 % (9624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (9624)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (9624)Memory used [KB]: 956
% 0.57/0.74 % (9624)Time elapsed: 0.002 s
% 0.57/0.74 % (9624)Instructions burned: 2 (million)
% 0.57/0.74 % (9616)Success in time 0.378 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------