%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC288+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:03:18 PM UTC 2026
% Result : Theorem 3.47s 1.17s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 1 def)
% Number of atoms : 155 ( 39 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 192 ( 63 ~; 54 |; 64 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 43 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| strictorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| strictorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f132,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f147,definition,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f148,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( sP0(X2,X3)
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f98,f147]) ).
fof(f149,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
inference(nnf_transformation,[],[f147]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& cons(X2,nil) = X0
& app(app(X3,X0),X4) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ lt(X2,X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(X4,X6)
| ~ lt(X6,X2) ) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f149]) ).
fof(f151,plain,
! [X0,X1] :
( ( ssList(sK3(X0,X1))
& cons(sK1(X0,X1),nil) = X0
& app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK2(X0,X1),X5)
| ~ lt(sK1(X0,X1),X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(sK3(X0,X1),X6)
| ~ lt(X6,sK1(X0,X1)) )
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f150]) ).
fof(f152,plain,
( ssList(sK7)
& sK5 = sK7
& sK4 = sK6
& ~ strictorderedP(sK4)
& ( sP0(sK6,sK7)
| ( nil = sK7
& nil = sK6 ) )
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f148]) ).
fof(f172,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f151]) ).
fof(f177,plain,
! [X0,X1] :
( cons(sK1(X0,X1),nil) = X0
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f151]) ).
fof(f182,plain,
( sP0(sK6,sK7)
| nil = sK6 ),
inference(cnf_transformation,[],[f152]) ).
fof(f184,plain,
~ strictorderedP(sK4),
inference(cnf_transformation,[],[f152]) ).
fof(f185,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f152]) ).
fof(f235,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f236,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f253,plain,
~ strictorderedP(sK6),
inference(definition_unfolding,[],[f184,f185]) ).
fof(f271,plain,
! [X0,X1] :
( strictorderedP(X0)
| ~ ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(superposition,[],[f236,f177]) ).
fof(f280,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| strictorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f271,f172]) ).
fof(f286,plain,
( strictorderedP(sK6)
| nil = sK6 ),
inference(resolution,[],[f280,f182]) ).
fof(f287,plain,
nil = sK6,
inference(forward_subsumption_resolution,[],[f286,f253]) ).
fof(f294,plain,
strictorderedP(sK6),
inference(superposition,[],[f235,f287]) ).
fof(f296,plain,
$false,
inference(forward_subsumption_resolution,[],[f294,f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC288+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.19 % Computer : n014.cluster.edu
% 0.06/0.19 % Model : x86_64 x86_64
% 0.06/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19 % Memory : 8046.5625MB
% 0.06/0.19 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Mon Sep 28 08:53:01 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.22 Running first-order theorem proving
% 0.06/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.47/1.17 % (1644488)Detected formulas, will run a generic FOF schedule.
% 3.47/1.17 % (1644493)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2998811203:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.47/1.17 % (1644496)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2118227859:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.47/1.17 % (1644499)dis-21_1_sil=8000:lcm=predicate:random_seed=2065197146:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.47/1.17 % (1644495)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3580119066:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.47/1.17 % (1644494)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=290074150:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.47/1.17 % (1644496)Refutation not found, incomplete strategy
% 3.47/1.17 % (1644496)------------------------------
% 3.47/1.17 % (1644496)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.17 % (1644496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.17 % (1644496)CaDiCaL version: 2.1.3
% 3.47/1.17 % (1644496)Termination reason: Refutation not found, incomplete strategy
% 3.47/1.17 % (1644496)Time elapsed: 0.005 s
% 3.47/1.17 % (1644496)Peak memory usage: 89 MB
% 3.47/1.17 % (1644496)Instructions burned: 6 (million)
% 3.47/1.17 % (1644497)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2987398571:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.47/1.17 % (1644498)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2692934257:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.47/1.17 % (1644497)First to succeed.
% 3.47/1.17 % (1644497)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1644488"
% 3.47/1.17 % (1644498)Also succeeded, but the first one will report.
% 3.47/1.17 % (1644499)Instruction limit reached!
% 3.47/1.17 % (1644499)------------------------------
% 3.47/1.17 % (1644499)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.17 % (1644499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.17 % (1644499)CaDiCaL version: 2.1.3
% 3.47/1.17 % (1644499)Termination reason: Instruction limit
% 3.47/1.17 % (1644499)Termination phase: Saturation
% 3.47/1.17 % (1644499)Time elapsed: 0.069 s
% 3.47/1.17 % (1644499)Peak memory usage: 91 MB
% 3.47/1.17 % (1644499)Instructions burned: 129 (million)
% 3.47/1.17 % (1644507)lrs+10_1_sil=8000:sp=occurrence:random_seed=2072895108:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.47/1.17 % (1644507)Also succeeded, but the first one will report.
% 3.47/1.17 % (1644496)------------------------------
% 3.47/1.17 % (1644496)------------------------------
% 3.47/1.17 % (1644497)Refutation found. Thanks to Tanya!
% 3.47/1.17 % SZS status Theorem for theBenchmark
% 3.47/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.17 % (1644497)------------------------------
% 3.47/1.17 % (1644497)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.17 % (1644497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.17 % (1644497)CaDiCaL version: 2.1.3
% 3.47/1.17 % (1644497)Termination reason: Refutation
% 3.47/1.17 % (1644497)Time elapsed: 0.005 s
% 3.47/1.17 % (1644497)Peak memory usage: 88 MB
% 3.47/1.17 % (1644497)Instructions burned: 5 (million)
% 3.47/1.17 % (1644497)------------------------------
% 3.47/1.17 % (1644497)------------------------------
% 3.47/1.17 % (1644488)Success in time 0.415 s
% 3.47/1.17 % Vampire exiting
%------------------------------------------------------------------------------