TSTP Solution File: SWV397+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.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 : n002.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 18:45:27 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 36 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 13 ~; 3 |; 5 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 54 ( 42 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f76,plain,
$false,
inference(subsumption_resolution,[],[f75,f67]) ).
fof(f67,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f47]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f75,plain,
ok(triple(sK1,sK0,bad)),
inference(backward_demodulation,[],[f63,f73]) ).
fof(f73,plain,
! [X0,X1] : triple(X0,sK0,bad) = remove_cpq(triple(X0,sK0,X1),sK2),
inference(resolution,[],[f68,f62]) ).
fof(f62,plain,
~ contains_slb(sK0,sK2),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
( ok(remove_cpq(triple(sK1,sK0,sK3),sK2))
& ~ contains_slb(sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f54,f55]) ).
fof(f55,plain,
( ? [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X1,X0,X3),X2))
& ~ contains_slb(X0,X2) )
=> ( ok(remove_cpq(triple(sK1,sK0,sK3),sK2))
& ~ contains_slb(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X1,X0,X3),X2))
& ~ contains_slb(X0,X2) ),
inference(rectify,[],[f50]) ).
fof(f50,plain,
? [X3,X0,X2,X1] :
( ok(remove_cpq(triple(X0,X3,X1),X2))
& ~ contains_slb(X3,X2) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,plain,
~ ! [X2,X0,X3,X1] :
( ok(remove_cpq(triple(X0,X3,X1),X2))
=> contains_slb(X3,X2) ),
inference(rectify,[],[f43]) ).
fof(f43,negated_conjecture,
~ ! [X0,X2,X3,X1] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
inference(negated_conjecture,[],[f42]) ).
fof(f42,conjecture,
! [X0,X2,X3,X1] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l33_co) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( contains_slb(X0,X2)
| remove_cpq(triple(X3,X0,X1),X2) = triple(X3,X0,bad) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X3,X0,X1),X2) = triple(X3,X0,bad)
| contains_slb(X0,X2) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X3,X1,X0,X2] :
( remove_cpq(triple(X2,X3,X1),X0) = triple(X2,X3,bad)
| contains_slb(X3,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,plain,
! [X1,X2,X3,X0] :
( ~ contains_slb(X3,X0)
=> remove_cpq(triple(X2,X3,X1),X0) = triple(X2,X3,bad) ),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
! [X3,X2,X0,X1] :
( ~ contains_slb(X1,X3)
=> triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax43) ).
fof(f63,plain,
ok(remove_cpq(triple(sK1,sK0,sK3),sK2)),
inference(cnf_transformation,[],[f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 19:34:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47 % (9852)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.19/0.48 % (9875)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.48 % (9852)First to succeed.
% 0.19/0.48 % (9860)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.49 % (9852)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (9852)------------------------------
% 0.19/0.49 % (9852)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (9852)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (9852)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (9852)Memory used [KB]: 6012
% 0.19/0.49 % (9852)Time elapsed: 0.095 s
% 0.19/0.49 % (9852)Instructions burned: 2 (million)
% 0.19/0.49 % (9852)------------------------------
% 0.19/0.49 % (9852)------------------------------
% 0.19/0.49 % (9847)Success in time 0.145 s
%------------------------------------------------------------------------------