TSTP Solution File: SWV392+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV392+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 : n015.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:42 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 38 ( 9 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 44 ( 17 ~; 2 |; 19 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 8 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f94,plain,
$false,
inference(subsumption_resolution,[],[f80,f87]) ).
fof(f87,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f80,plain,
contains_slb(create_slb,sK2),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
( ~ pair_in_list(remove_slb(create_slb,sK2),sK0,sK1)
& contains_slb(create_slb,sK2)
& sK0 != sK2
& pair_in_list(create_slb,sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f41,f58,f57]) ).
fof(f57,plain,
( ? [X0,X1] :
( ? [X2] :
( ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
& contains_slb(create_slb,X2)
& X0 != X2 )
& pair_in_list(create_slb,X0,X1) )
=> ( ? [X2] :
( ~ pair_in_list(remove_slb(create_slb,X2),sK0,sK1)
& contains_slb(create_slb,X2)
& sK0 != X2 )
& pair_in_list(create_slb,sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
( ? [X2] :
( ~ pair_in_list(remove_slb(create_slb,X2),sK0,sK1)
& contains_slb(create_slb,X2)
& sK0 != X2 )
=> ( ~ pair_in_list(remove_slb(create_slb,sK2),sK0,sK1)
& contains_slb(create_slb,sK2)
& sK0 != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
? [X0,X1] :
( ? [X2] :
( ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
& contains_slb(create_slb,X2)
& X0 != X2 )
& pair_in_list(create_slb,X0,X1) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
? [X1,X0] :
( ? [X2] :
( ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
& X0 != X2
& contains_slb(create_slb,X2) )
& pair_in_list(create_slb,X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X1,X0] :
( pair_in_list(create_slb,X0,X1)
=> ! [X2] :
( contains_slb(create_slb,X2)
=> ( pair_in_list(remove_slb(create_slb,X2),X0,X1)
| X0 = X2 ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X1,X0] :
( pair_in_list(create_slb,X0,X1)
=> ! [X2] :
( contains_slb(create_slb,X2)
=> ( pair_in_list(remove_slb(create_slb,X2),X0,X1)
| X0 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_co) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV392+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.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 19:33:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48 % (6761)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.49 % (6761)First to succeed.
% 0.19/0.49 % (6761)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 % (6761)------------------------------
% 0.19/0.49 % (6761)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (6761)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (6761)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (6761)Memory used [KB]: 5500
% 0.19/0.49 % (6761)Time elapsed: 0.004 s
% 0.19/0.49 % (6761)Instructions burned: 3 (million)
% 0.19/0.49 % (6761)------------------------------
% 0.19/0.49 % (6761)------------------------------
% 0.19/0.49 % (6740)Success in time 0.143 s
%------------------------------------------------------------------------------