TSTP Solution File: SYN384+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN384+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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 : Sun May 5 12:09:59 EDT 2024
% Result : Theorem 0.10s 0.38s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 18 ( 8 ~; 0 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 28 ( 18 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,plain,
$false,
inference(resolution,[],[f8,f7]) ).
fof(f7,plain,
! [X2,X1] : big_p(X1,X2,sK0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X1,X2] :
( ~ big_p(sK1(X1,X2),X1,X1)
& big_p(X1,X2,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f3,f5,f4]) ).
fof(f4,plain,
( ? [X0] :
! [X1,X2] :
? [X3] :
( ~ big_p(X3,X1,X1)
& big_p(X1,X2,X0) )
=> ! [X2,X1] :
? [X3] :
( ~ big_p(X3,X1,X1)
& big_p(X1,X2,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X1,X2] :
( ? [X3] :
( ~ big_p(X3,X1,X1)
& big_p(X1,X2,sK0) )
=> ( ~ big_p(sK1(X1,X2),X1,X1)
& big_p(X1,X2,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f3,plain,
? [X0] :
! [X1,X2] :
? [X3] :
( ~ big_p(X3,X1,X1)
& big_p(X1,X2,X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1,X2] :
! [X3] :
( big_p(X1,X2,X0)
=> big_p(X3,X1,X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0] :
? [X1,X2] :
! [X3] :
( big_p(X1,X2,X0)
=> big_p(X3,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2136) ).
fof(f8,plain,
! [X2,X1] : ~ big_p(sK1(X1,X2),X1,X1),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : SYN384+1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8042.1875MB
% 0.10/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri May 3 17:15:08 EDT 2024
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % (28503)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.37 % (28505)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.37 TRYING [1,1,1]
% 0.10/0.37 TRYING [2,2,1]
% 0.10/0.37 Cannot enumerate next child to try in an incomplete setup
% 0.10/0.37 % (28505)Refutation not found, incomplete strategy% (28505)------------------------------
% 0.10/0.37 % (28505)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.10/0.37 % (28505)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.37
% 0.10/0.37 % (28505)Memory used [KB]: 722
% 0.10/0.37 % (28505)Time elapsed: 0.003 s
% 0.10/0.37 % (28505)Instructions burned: 2 (million)
% 0.10/0.37 % (28509)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.10/0.37 % (28506)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.10/0.37 % (28507)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.10/0.37 % (28510)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.37 % (28505)------------------------------
% 0.10/0.37 % (28505)------------------------------
% 0.10/0.37 % (28508)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.10/0.37 TRYING [1,1,1]
% 0.10/0.37 TRYING [1]
% 0.10/0.37 % (28504)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.37 TRYING [2,2,1]
% 0.10/0.37 Cannot enumerate next child to try in an incomplete setup
% 0.10/0.37 TRYING [2]
% 0.10/0.37 % (28509)Also succeeded, but the first one will report.
% 0.10/0.37 % (28507)Refutation not found, incomplete strategy% (28507)------------------------------
% 0.10/0.37 % (28507)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.10/0.37 % (28507)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.37 % (28506)First to succeed.
% 0.10/0.37
% 0.10/0.37 % (28507)Memory used [KB]: 722
% 0.10/0.37 % (28507)Time elapsed: 0.002 s
% 0.10/0.37 % (28507)Instructions burned: 2 (million)
% 0.10/0.37 % (28510)Also succeeded, but the first one will report.
% 0.10/0.37 % (28508)Also succeeded, but the first one will report.
% 0.10/0.37 % (28507)------------------------------
% 0.10/0.37 % (28507)------------------------------
% 0.10/0.38 % (28506)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28503"
% 0.10/0.38 TRYING [1]
% 0.10/0.38 TRYING [2]
% 0.10/0.38 % (28504)Also succeeded, but the first one will report.
% 0.10/0.38 % (28506)Refutation found. Thanks to Tanya!
% 0.10/0.38 % SZS status Theorem for theBenchmark
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.38 % (28506)------------------------------
% 0.10/0.38 % (28506)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.10/0.38 % (28506)Termination reason: Refutation
% 0.10/0.38
% 0.10/0.38 % (28506)Memory used [KB]: 731
% 0.10/0.38 % (28506)Time elapsed: 0.003 s
% 0.10/0.38 % (28506)Instructions burned: 2 (million)
% 0.10/0.38 % (28503)Success in time 0.014 s
%------------------------------------------------------------------------------