TSTP Solution File: SWC264+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC264+1 : TPTP v8.1.0. Released v2.4.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 : n013.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:39:58 EDT 2022
% Result : Theorem 0.21s 0.49s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 7 unt; 0 def)
% Number of atoms : 212 ( 18 equ)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 290 ( 120 ~; 130 |; 9 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 83 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f606,plain,
$false,
inference(subsumption_resolution,[],[f605,f413]) ).
fof(f413,plain,
~ totalorderedP(sK12),
inference(definition_unfolding,[],[f261,f257]) ).
fof(f257,plain,
sK10 = sK12,
inference(cnf_transformation,[],[f203]) ).
fof(f203,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& strictorderedP(X2)
& ssList(X3)
& X1 = X3
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ~ ssList(X3)
| ~ strictorderedP(X2)
| X1 != X3
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ~ ssList(X3)
| ~ strictorderedP(X2)
| X1 != X3
| totalorderedP(X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f261,plain,
~ totalorderedP(sK10),
inference(cnf_transformation,[],[f203]) ).
fof(f605,plain,
totalorderedP(sK12),
inference(subsumption_resolution,[],[f601,f262]) ).
fof(f262,plain,
ssList(sK12),
inference(cnf_transformation,[],[f203]) ).
fof(f601,plain,
( ~ ssList(sK12)
| totalorderedP(sK12) ),
inference(resolution,[],[f598,f260]) ).
fof(f260,plain,
strictorderedP(sK12),
inference(cnf_transformation,[],[f203]) ).
fof(f598,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(subsumption_resolution,[],[f597,f271]) ).
fof(f271,plain,
! [X0] :
( ssItem(sK15(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ! [X4] :
( ! [X5] :
( app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| leq(X1,X2)
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) ) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f196]) ).
fof(f196,plain,
! [X0] :
( ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
<=> totalorderedP(X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) )
<=> totalorderedP(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).
fof(f597,plain,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ ssItem(sK15(X0))
| ~ strictorderedP(X0) ),
inference(subsumption_resolution,[],[f596,f267]) ).
fof(f267,plain,
! [X0] :
( ~ leq(sK14(X0),sK15(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f596,plain,
! [X0] :
( leq(sK14(X0),sK15(X0))
| ~ ssItem(sK15(X0))
| ~ ssList(X0)
| totalorderedP(X0)
| ~ strictorderedP(X0) ),
inference(subsumption_resolution,[],[f594,f272]) ).
fof(f272,plain,
! [X0] :
( ssItem(sK14(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f594,plain,
! [X0] :
( ~ ssItem(sK14(X0))
| leq(sK14(X0),sK15(X0))
| ~ ssItem(sK15(X0))
| ~ strictorderedP(X0)
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(resolution,[],[f543,f383]) ).
fof(f383,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f182]) ).
fof(f182,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) )
| ~ ssItem(X1) ) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
fof(f543,plain,
! [X0] :
( lt(sK14(X0),sK15(X0))
| totalorderedP(X0)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(subsumption_resolution,[],[f542,f270]) ).
fof(f270,plain,
! [X0] :
( ssList(sK16(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f542,plain,
! [X0] :
( totalorderedP(X0)
| lt(sK14(X0),sK15(X0))
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssList(sK16(X0)) ),
inference(subsumption_resolution,[],[f541,f272]) ).
fof(f541,plain,
! [X0] :
( ~ ssItem(sK14(X0))
| ~ ssList(sK16(X0))
| ~ ssList(X0)
| ~ strictorderedP(X0)
| lt(sK14(X0),sK15(X0))
| totalorderedP(X0) ),
inference(subsumption_resolution,[],[f540,f269]) ).
fof(f269,plain,
! [X0] :
( ssList(sK17(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f540,plain,
! [X0] :
( ~ ssList(sK17(X0))
| ~ ssList(sK16(X0))
| lt(sK14(X0),sK15(X0))
| ~ ssList(X0)
| totalorderedP(X0)
| ~ strictorderedP(X0)
| ~ ssItem(sK14(X0)) ),
inference(subsumption_resolution,[],[f539,f271]) ).
fof(f539,plain,
! [X0] :
( ~ ssItem(sK15(X0))
| totalorderedP(X0)
| ~ ssItem(sK14(X0))
| ~ ssList(sK17(X0))
| ~ ssList(sK16(X0))
| ~ strictorderedP(X0)
| ~ ssList(X0)
| lt(sK14(X0),sK15(X0)) ),
inference(subsumption_resolution,[],[f537,f266]) ).
fof(f266,plain,
! [X0] :
( ssList(sK18(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f537,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(sK18(X0))
| lt(sK14(X0),sK15(X0))
| ~ strictorderedP(X0)
| totalorderedP(X0)
| ~ ssList(sK16(X0))
| ~ ssList(sK17(X0))
| ~ ssItem(sK15(X0))
| ~ ssItem(sK14(X0)) ),
inference(duplicate_literal_removal,[],[f534]) ).
fof(f534,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK18(X0))
| ~ ssList(sK17(X0))
| totalorderedP(X0)
| ~ ssList(sK16(X0))
| ~ ssItem(sK15(X0))
| ~ ssList(X0)
| ~ ssList(X0)
| ~ ssItem(sK14(X0))
| lt(sK14(X0),sK15(X0)) ),
inference(resolution,[],[f465,f435]) ).
fof(f435,plain,
! [X0] :
( sQ51_eqProxy(app(app(sK16(X0),cons(sK14(X0),sK17(X0))),cons(sK15(X0),sK18(X0))),X0)
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(equality_proxy_replacement,[],[f268,f415]) ).
fof(f415,plain,
! [X0,X1] :
( sQ51_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ51_eqProxy])]) ).
fof(f268,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK16(X0),cons(sK14(X0),sK17(X0))),cons(sK15(X0),sK18(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f465,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ sQ51_eqProxy(app(app(X3,cons(X1,X4)),cons(X2,X5)),X0)
| ~ ssList(X3)
| ~ ssList(X4)
| lt(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X5)
| ~ ssItem(X1)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(equality_proxy_replacement,[],[f351,f415]) ).
fof(f351,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ strictorderedP(X0)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X5)
| lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X4)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2)
| ~ ssList(X5) ) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
<=> strictorderedP(X0) ) ),
inference(flattening,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax12) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC264+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:37:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 % (19699)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.21/0.46 % (19688)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.48 % (19699)First to succeed.
% 0.21/0.49 % (19688)Instruction limit reached!
% 0.21/0.49 % (19688)------------------------------
% 0.21/0.49 % (19688)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (19699)Refutation found. Thanks to Tanya!
% 0.21/0.49 % SZS status Theorem for theBenchmark
% 0.21/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.49 % (19699)------------------------------
% 0.21/0.49 % (19699)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (19699)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49 % (19699)Termination reason: Refutation
% 0.21/0.49
% 0.21/0.49 % (19699)Memory used [KB]: 6396
% 0.21/0.49 % (19699)Time elapsed: 0.080 s
% 0.21/0.49 % (19699)Instructions burned: 15 (million)
% 0.21/0.49 % (19699)------------------------------
% 0.21/0.49 % (19699)------------------------------
% 0.21/0.49 % (19678)Success in time 0.141 s
%------------------------------------------------------------------------------