TSTP Solution File: SWV369+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV369+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_sat --cores 0 -t %d %s
% Computer : n014.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:56:38 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 64 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 19 |; 7 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 53 ( 41 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f303,plain,
$false,
inference(resolution,[],[f301,f287]) ).
fof(f287,plain,
contains_cpq(sF4,sK1),
inference(subsumption_resolution,[],[f285,f218]) ).
fof(f218,plain,
! [X0] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : ~ contains_pq(create_pq,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax8) ).
fof(f285,plain,
( contains_pq(create_pq,sK1)
| contains_cpq(sF4,sK1) ),
inference(backward_demodulation,[],[f277,f284]) ).
fof(f284,plain,
create_pq = sF5,
inference(backward_demodulation,[],[f275,f283]) ).
fof(f283,plain,
create_pq = i(sF4),
inference(superposition,[],[f219,f274]) ).
fof(f274,plain,
triple(sK0,create_slb,sK2) = sF4,
introduced(function_definition,[]) ).
fof(f219,plain,
! [X0,X1] : create_pq = i(triple(X1,create_slb,X0)),
inference(cnf_transformation,[],[f158]) ).
fof(f158,plain,
! [X0,X1] : create_pq = i(triple(X1,create_slb,X0)),
inference(rectify,[],[f54]) ).
fof(f54,axiom,
! [X1,X0] : create_pq = i(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).
fof(f275,plain,
i(sF4) = sF5,
introduced(function_definition,[]) ).
fof(f277,plain,
( contains_cpq(sF4,sK1)
| contains_pq(sF5,sK1) ),
inference(definition_folding,[],[f229,f275,f274,f274]) ).
fof(f229,plain,
( contains_cpq(triple(sK0,create_slb,sK2),sK1)
| contains_pq(i(triple(sK0,create_slb,sK2)),sK1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f170,plain,
( ( ~ contains_cpq(triple(sK0,create_slb,sK2),sK1)
| ~ contains_pq(i(triple(sK0,create_slb,sK2)),sK1) )
& ( contains_cpq(triple(sK0,create_slb,sK2),sK1)
| contains_pq(i(triple(sK0,create_slb,sK2)),sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f168,f169]) ).
fof(f169,plain,
( ? [X0,X1,X2] :
( ( ~ contains_cpq(triple(X0,create_slb,X2),X1)
| ~ contains_pq(i(triple(X0,create_slb,X2)),X1) )
& ( contains_cpq(triple(X0,create_slb,X2),X1)
| contains_pq(i(triple(X0,create_slb,X2)),X1) ) )
=> ( ( ~ contains_cpq(triple(sK0,create_slb,sK2),sK1)
| ~ contains_pq(i(triple(sK0,create_slb,sK2)),sK1) )
& ( contains_cpq(triple(sK0,create_slb,sK2),sK1)
| contains_pq(i(triple(sK0,create_slb,sK2)),sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
? [X0,X1,X2] :
( ( ~ contains_cpq(triple(X0,create_slb,X2),X1)
| ~ contains_pq(i(triple(X0,create_slb,X2)),X1) )
& ( contains_cpq(triple(X0,create_slb,X2),X1)
| contains_pq(i(triple(X0,create_slb,X2)),X1) ) ),
inference(rectify,[],[f167]) ).
fof(f167,plain,
? [X2,X0,X1] :
( ( ~ contains_cpq(triple(X2,create_slb,X1),X0)
| ~ contains_pq(i(triple(X2,create_slb,X1)),X0) )
& ( contains_cpq(triple(X2,create_slb,X1),X0)
| contains_pq(i(triple(X2,create_slb,X1)),X0) ) ),
inference(nnf_transformation,[],[f110]) ).
fof(f110,plain,
? [X2,X0,X1] :
( contains_pq(i(triple(X2,create_slb,X1)),X0)
<~> contains_cpq(triple(X2,create_slb,X1),X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,plain,
~ ! [X1,X2,X0] :
( contains_cpq(triple(X2,create_slb,X1),X0)
<=> contains_pq(i(triple(X2,create_slb,X1)),X0) ),
inference(rectify,[],[f64]) ).
fof(f64,negated_conjecture,
~ ! [X2,X1,X0] :
( contains_pq(i(triple(X0,create_slb,X1)),X2)
<=> contains_cpq(triple(X0,create_slb,X1),X2) ),
inference(negated_conjecture,[],[f63]) ).
fof(f63,conjecture,
! [X2,X1,X0] :
( contains_pq(i(triple(X0,create_slb,X1)),X2)
<=> contains_cpq(triple(X0,create_slb,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l5_co) ).
fof(f301,plain,
! [X0] : ~ contains_cpq(sF4,X0),
inference(subsumption_resolution,[],[f300,f213]) ).
fof(f213,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f300,plain,
! [X0] :
( contains_slb(create_slb,X0)
| ~ contains_cpq(sF4,X0) ),
inference(superposition,[],[f201,f274]) ).
fof(f201,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X3,X1),X2)
| contains_slb(X3,X2) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X3,X1),X2)
| ~ contains_slb(X3,X2) )
& ( contains_slb(X3,X2)
| ~ contains_cpq(triple(X0,X3,X1),X2) ) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X3,X1,X0,X2] :
( ( contains_cpq(triple(X3,X2,X1),X0)
| ~ contains_slb(X2,X0) )
& ( contains_slb(X2,X0)
| ~ contains_cpq(triple(X3,X2,X1),X0) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X3,X1,X0,X2] :
( contains_cpq(triple(X3,X2,X1),X0)
<=> contains_slb(X2,X0) ),
inference(rectify,[],[f39]) ).
fof(f39,axiom,
! [X3,X2,X1,X0] :
( contains_slb(X1,X3)
<=> contains_cpq(triple(X0,X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 19:23:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (23854)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.50 % (23846)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (23861)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.50 % (23853)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51 % (23854)First to succeed.
% 0.20/0.51 % (23845)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (23862)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.52 % (23854)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (23854)------------------------------
% 0.20/0.52 % (23854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (23854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (23854)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (23854)Memory used [KB]: 1151
% 0.20/0.52 % (23854)Time elapsed: 0.106 s
% 0.20/0.52 % (23854)Instructions burned: 7 (million)
% 0.20/0.52 % (23854)------------------------------
% 0.20/0.52 % (23854)------------------------------
% 0.20/0.52 % (23838)Success in time 0.162 s
%------------------------------------------------------------------------------