%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE064+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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 11:40:48 AM UTC 2026
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 30 unt; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f13,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(f15,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(f18,conjecture,
! [X0,X1] :
( addition(domain(X0),domain(X1)) = domain(X1)
=> addition(X0,multiplication(domain(X1),X0)) = multiplication(domain(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] :
( addition(domain(X0),domain(X1)) = domain(X1)
=> addition(X0,multiplication(domain(X1),X0)) = multiplication(domain(X1),X0) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( multiplication(domain(X1),X0) != addition(X0,multiplication(domain(X1),X0))
& addition(domain(X0),domain(X1)) = domain(X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
( multiplication(domain(sK1),sK0) != addition(sK0,multiplication(domain(sK1),sK0))
& domain(sK1) = addition(domain(sK0),domain(sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).
fof(f22,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f25,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f26,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f28,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f33,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f35,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f15]) ).
fof(f38,plain,
domain(sK1) = addition(domain(sK0),domain(sK1)),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
multiplication(domain(sK1),sK0) != addition(sK0,multiplication(domain(sK1),sK0)),
inference(cnf_transformation,[],[f21]) ).
fof(f48,plain,
! [X0] : one = addition(one,domain(X0)),
inference(superposition,[],[f35,f22]) ).
fof(f280,plain,
! [X0,X1] : multiplication(multiplication(domain(X0),X0),X1) = addition(multiplication(X0,X1),multiplication(multiplication(domain(X0),X0),X1)),
inference(superposition,[],[f30,f33]) ).
fof(f285,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
inference(superposition,[],[f30,f48]) ).
fof(f290,plain,
! [X0] : multiplication(domain(sK1),X0) = addition(multiplication(domain(sK0),X0),multiplication(domain(sK1),X0)),
inference(superposition,[],[f30,f38]) ).
fof(f315,plain,
! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
inference(forward_demodulation,[],[f285,f28]) ).
fof(f320,plain,
! [X0,X1] : multiplication(domain(X0),multiplication(X0,X1)) = addition(multiplication(X0,X1),multiplication(domain(X0),multiplication(X0,X1))),
inference(forward_demodulation,[],[f280,f26]) ).
fof(f334,plain,
! [X0,X1] : multiplication(X0,X1) = multiplication(domain(X0),multiplication(X0,X1)),
inference(forward_demodulation,[],[f320,f315]) ).
fof(f761,plain,
! [X0] : multiplication(domain(sK1),multiplication(sK0,X0)) = addition(multiplication(sK0,X0),multiplication(domain(sK1),multiplication(sK0,X0))),
inference(superposition,[],[f290,f334]) ).
fof(f766,plain,
! [X0] : multiplication(sK0,X0) = multiplication(domain(sK1),multiplication(sK0,X0)),
inference(forward_demodulation,[],[f761,f315]) ).
fof(f799,plain,
sK0 = multiplication(domain(sK1),sK0),
inference(superposition,[],[f766,f27]) ).
fof(f951,plain,
sK0 != addition(sK0,sK0),
inference(superposition,[],[f39,f799]) ).
fof(f958,plain,
$false,
inference(forward_subsumption_resolution,[],[f951,f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE064+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n005.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 : Sun Sep 27 13:08:32 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.18/0.46 % (3976606)Will run a generic schedule for satisfiability detection.
% 0.18/0.46 % (3976611)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1438849501_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.46 % TRYING [1]
% 0.18/0.46 % TRYING [2]
% 0.18/0.46 % TRYING [3]
% 0.18/0.46 % TRYING [4]
% 0.18/0.46 % (3976612)% WARNING: option uhcvi not known.
% 0.18/0.46 % (3976617)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3071387169:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.46 % (3976614)dis+10_1_sil=32000:sp=arity:random_seed=4028983940:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.46 % (3976613)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2496852489:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.46 % (3976615)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1030776947:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.46 % (3976616)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1924098155:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.46 % (3976612)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1515417871:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.46 % TRYING [5]
% 0.18/0.46 % (3976616) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3976606-3976616"...
% 0.18/0.46 % (3976616)...printing done.
% 0.18/0.46 % (3976616)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (3976616)------------------------------
% 0.18/0.46 % (3976616)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46 % (3976616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46 % (3976616)CaDiCaL version: 2.1.3
% 0.18/0.46 % (3976616)Termination reason: Refutation
% 0.18/0.46 % (3976616)Time elapsed: 0.021 s
% 0.18/0.46 % (3976616)Peak memory usage: 12 MB
% 0.18/0.46 % (3976616)Instructions burned: 34 (million)
% 0.18/0.46 % (3976606)Success in time 0.062 s
% 0.18/0.46 % Vampire exiting
%------------------------------------------------------------------------------