TSTP Solution File: SWV412+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV412+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 : 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 : Wed Aug 31 18:45:30 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 57 ( 17 ~; 8 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 36 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f136,plain,
$false,
inference(unit_resulting_resolution,[],[f56,f57,f59,f77]) ).
fof(f77,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X0,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X0,X2,X3) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X2,X3,X1,X0] :
( pair_in_list(update_slb(X2,X3),X1,X3)
| ~ strictly_less_than(X0,X3)
| ~ pair_in_list(X2,X1,X0) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X3,X1,X2] :
( pair_in_list(update_slb(X2,X3),X1,X3)
| ~ pair_in_list(X2,X1,X0)
| ~ strictly_less_than(X0,X3) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X3,X1,X2] :
( ( pair_in_list(X2,X1,X0)
& strictly_less_than(X0,X3) )
=> pair_in_list(update_slb(X2,X3),X1,X3) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X2,X1,X0,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_li3839) ).
fof(f59,plain,
~ pair_in_list(update_slb(sK1,sK3),sK2,sK3),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
( ~ pair_in_list(update_slb(sK1,sK3),sK2,sK3)
& strictly_less_than(sK2,sK3)
& pair_in_list(sK1,sK2,sK0)
& strictly_less_than(sK0,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f40,f41]) ).
fof(f41,plain,
( ? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X1,X3),X2,X3)
& strictly_less_than(X2,X3)
& pair_in_list(X1,X2,X0)
& strictly_less_than(X0,X3) )
=> ( ~ pair_in_list(update_slb(sK1,sK3),sK2,sK3)
& strictly_less_than(sK2,sK3)
& pair_in_list(sK1,sK2,sK0)
& strictly_less_than(sK0,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X1,X3),X2,X3)
& strictly_less_than(X2,X3)
& pair_in_list(X1,X2,X0)
& strictly_less_than(X0,X3) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
? [X3,X0,X2,X1] :
( ~ pair_in_list(update_slb(X0,X1),X2,X1)
& strictly_less_than(X2,X1)
& pair_in_list(X0,X2,X3)
& strictly_less_than(X3,X1) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
? [X3,X2,X1,X0] :
( ~ pair_in_list(update_slb(X0,X1),X2,X1)
& strictly_less_than(X2,X1)
& strictly_less_than(X3,X1)
& pair_in_list(X0,X2,X3) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
~ ! [X3,X2,X1,X0] :
( ( strictly_less_than(X2,X1)
& strictly_less_than(X3,X1)
& pair_in_list(X0,X2,X3) )
=> pair_in_list(update_slb(X0,X1),X2,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,negated_conjecture,
~ ! [X0,X3,X1,X2] :
( ( strictly_less_than(X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(negated_conjecture,[],[f20]) ).
fof(f20,conjecture,
! [X0,X3,X1,X2] :
( ( strictly_less_than(X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_co) ).
fof(f57,plain,
pair_in_list(sK1,sK2,sK0),
inference(cnf_transformation,[],[f42]) ).
fof(f56,plain,
strictly_less_than(sK0,sK3),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV412+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n007.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:08:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.47 % (6349)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.48 % (6357)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.48 % (6349)First to succeed.
% 0.20/0.48 % (6349)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (6349)------------------------------
% 0.20/0.48 % (6349)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (6349)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (6349)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (6349)Memory used [KB]: 6012
% 0.20/0.48 % (6349)Time elapsed: 0.083 s
% 0.20/0.48 % (6349)Instructions burned: 4 (million)
% 0.20/0.48 % (6349)------------------------------
% 0.20/0.48 % (6349)------------------------------
% 0.20/0.48 % (6341)Success in time 0.134 s
%------------------------------------------------------------------------------