%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:04:15 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 97 ( 38 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 126 ( 48 ~; 38 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 39 ( 26 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) )
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X7,X8),X9) != X3
| app(X7,X9) != 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
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) )
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X7,X8),X9) != X3
| app(X7,X9) != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(app(X7,X8),X9) = X3
& app(X7,X9) = X2 )
& ssList(X8) )
& ssList(X7) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f295,plain,
( ssList(sK56)
& sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ) ) )
& ssList(sK59)
& sK56 = app(app(sK57,sK58),sK59)
& sK55 = app(sK57,sK59)
& ssList(sK58)
& ssList(sK57)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57),skolemize(X8,sK58),skolemize(X9,sK59)],[f221]) ).
fof(f498,plain,
ssList(sK57),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
ssList(sK58),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
sK55 = app(sK57,sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
sK56 = app(app(sK57,sK58),sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f503,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK56
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssList(X4)
| app(X4,X6) != sK55 ),
inference(definition_unfolding,[],[f503,f505,f504]) ).
fof(f581,plain,
( sK56 != sK56
| ~ ssList(sK58)
| ~ ssList(sK59)
| ~ ssList(sK57)
| sK55 != app(sK57,sK59) ),
inference(superposition,[],[f507,f501]) ).
fof(f582,plain,
( ~ ssList(sK58)
| ~ ssList(sK59)
| ~ ssList(sK57)
| sK55 != app(sK57,sK59) ),
inference(trivial_inequality_removal,[],[f581]) ).
fof(f583,plain,
( ~ ssList(sK59)
| ~ ssList(sK57)
| sK55 != app(sK57,sK59) ),
inference(forward_subsumption_resolution,[],[f582,f499]) ).
fof(f586,plain,
( ~ ssList(sK57)
| sK55 != app(sK57,sK59) ),
inference(forward_subsumption_resolution,[],[f583,f502]) ).
fof(f596,plain,
sK55 != app(sK57,sK59),
inference(forward_subsumption_resolution,[],[f586,f498]) ).
fof(f597,plain,
$false,
inference(forward_subsumption_resolution,[],[f596,f500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:25:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.46 % (3826258)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (3826263)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=817980180_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46 % (3826265)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2076235334:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46 % (3826266)dis+10_1_sil=32000:sp=arity:random_seed=208539676:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46 % (3826267)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2505233452:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % TRYING [1]
% 0.10/0.46 % (3826268)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3227847963:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % (3826269)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1936224990:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46 % TRYING [2]
% 0.10/0.46 % TRYING [3]
% 0.10/0.46 % (3826266) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3826258-3826266"...
% 0.10/0.46 % (3826266)...printing done.
% 0.10/0.46 % (3826265) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3826258-3826265"...
% 0.10/0.46 % (3826264)% WARNING: option uhcvi not known.
% 0.10/0.46 % (3826266)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (3826266)------------------------------
% 0.10/0.46 % (3826266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (3826266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (3826266)CaDiCaL version: 2.1.3
% 0.10/0.46 % (3826266)Termination reason: Refutation
% 0.10/0.46 % (3826266)Time elapsed: 0.006 s
% 0.10/0.46 % (3826266)Peak memory usage: 12 MB
% 0.10/0.46 % (3826266)Instructions burned: 10 (million)
% 0.10/0.46 % (3826258)Success in time 0.051 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------