%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:46:44 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 31 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 11 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : impl(btrue,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
fof(f4,axiom,
! [X0] : append(nil,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
fof(f6,axiom,
! [X0] : linP(aP(X0)) = append(cons(a,nil),append(linP(X0),cons(a,nil))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).
fof(f8,axiom,
linP(pA) = cons(a,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(f9,plain,
cons(a,nil) = linP(pA),
inference(reorient_equations,[],[f8]) ).
fof(f12,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
fof(f13,plain,
nil = linP(pE),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
fof(f15,axiom,
! [X0,X1] : unambig(X0,X1) = impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
fof(f28,axiom,
eq3(pE,pA) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
fof(f29,plain,
bfalse = eq3(pE,pA),
inference(reorient_equations,[],[f28]) ).
fof(f67,axiom,
! [X2,X3,X0,X1] :
( eq3(X0,X1) != bfalse
| eq4(c2(X0,X2),c2(X1,X3)) = bfalse ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_037) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( bfalse != eq3(X0,X1)
| bfalse = eq4(c2(X0,X2),c2(X1,X3)) ),
inference(reorient_equations,[],[f67]) ).
fof(f71,axiom,
! [X0] : eq(X0,X0) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_039) ).
fof(f72,plain,
! [X0] : btrue = eq(X0,X0),
inference(reorient_equations,[],[f71]) ).
fof(f79,axiom,
! [X0] : eq5(X0,X0) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_043) ).
fof(f80,plain,
! [X0] : btrue = eq5(X0,X0),
inference(reorient_equations,[],[f79]) ).
fof(f89,negated_conjecture,
! [X0,X1] : eq5(unambig(X0,X1),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f90,plain,
! [X0,X1] : btrue != eq5(unambig(X0,X1),bfalse),
inference(reorient_equations,[],[f89]) ).
fof(f91,plain,
! [X0,X1] : btrue != eq5(impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),bfalse),
inference(definition_unfolding,[],[f90,f15]) ).
fof(f108,plain,
! [X0] : linC(c2(pE,X0)) = append(nil,linP(X0)),
inference(superposition,[],[f14,f13]) ).
fof(f110,plain,
! [X0] : linP(X0) = linC(c2(pE,X0)),
inference(forward_demodulation,[],[f108,f4]) ).
fof(f124,plain,
! [X0] : linP(aP(X0)) = append(linP(pA),append(linP(X0),linP(pA))),
inference(forward_demodulation,[],[f6,f9]) ).
fof(f125,plain,
! [X0] : linP(aP(X0)) = append(linP(pA),linC(c2(X0,pA))),
inference(forward_demodulation,[],[f124,f14]) ).
fof(f133,plain,
linP(aP(pE)) = append(linP(pA),linP(pA)),
inference(superposition,[],[f125,f110]) ).
fof(f135,plain,
linP(aP(pE)) = linC(c2(pA,pA)),
inference(forward_demodulation,[],[f133,f14]) ).
fof(f192,plain,
! [X0,X1] :
( bfalse != bfalse
| bfalse = eq4(c2(pE,X0),c2(pA,X1)) ),
inference(superposition,[],[f68,f29]) ).
fof(f195,plain,
! [X0,X1] : bfalse = eq4(c2(pE,X0),c2(pA,X1)),
inference(trivial_inequality_removal,[],[f192]) ).
fof(f276,plain,
! [X0] : btrue != eq5(impl(eq(linC(X0),linP(aP(pE))),eq4(X0,c2(pA,pA))),bfalse),
inference(superposition,[],[f91,f135]) ).
fof(f323,plain,
! [X0] : btrue != eq5(impl(eq(linC(c2(pE,X0)),linP(aP(pE))),bfalse),bfalse),
inference(superposition,[],[f276,f195]) ).
fof(f326,plain,
! [X0] : btrue != eq5(impl(eq(linP(X0),linP(aP(pE))),bfalse),bfalse),
inference(forward_demodulation,[],[f323,f110]) ).
fof(f335,plain,
btrue != eq5(impl(btrue,bfalse),bfalse),
inference(superposition,[],[f326,f72]) ).
fof(f336,plain,
btrue != eq5(bfalse,bfalse),
inference(forward_demodulation,[],[f335,f1]) ).
fof(f337,plain,
$false,
inference(forward_subsumption_resolution,[],[f336,f80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n010.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 15:08:53 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.26 % (1996528)Will run a generic schedule for satisfiability detection.
% 0.20/0.26 % (1996537)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3798929970:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.26 % (1996534)% WARNING: option uhcvi not known.
% 0.20/0.26 % (1996533)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1828442638_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.26 % (1996534)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=267135930:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.26 % (1996536)dis+10_1_sil=32000:sp=arity:random_seed=1130840087:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.26 % (1996538)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3823642046:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.26 % (1996535)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3929209855:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.26 % (1996539)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3116684368:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.26 % TRYING [1]
% 0.20/0.26 % TRYING [2]
% 0.20/0.26 % TRYING [3]
% 0.20/0.26 % (1996536) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1996528-1996536"...
% 0.20/0.26 % (1996534) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1996528-1996534"...
% 0.20/0.26 % (1996536)...printing done.
% 0.20/0.26 % (1996536)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1996536)------------------------------
% 0.20/0.27 % (1996536)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1996536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1996536)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1996536)Termination reason: Refutation
% 0.20/0.27 % (1996536)Time elapsed: 0.010 s
% 0.20/0.27 % (1996536)Peak memory usage: 11 MB
% 0.20/0.27 % (1996536)Instructions burned: 16 (million)
% 0.20/0.27 % (1996528)Success in time 0.042 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------