0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_vampire %s %d THM
0.12/0.33	% Computer   : n020.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Wed Jul 30 05:40:04 EDT 2025
0.12/0.33	% CPUTime    : 
0.12/0.35	This is a TFF_ problem
0.12/0.36	Running first-order theorem proving
0.12/0.36	Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6792)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=1483253713:i=4:rtra=on_1200 on theBenchmark for (1200ds/4Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6791)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3575453783:s2a=on:i=7:rtra=on:inst=on_1200 on theBenchmark for (1200ds/7Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6789)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2588981302:i=307:kws=precedence:nm=0:rtra=on_1200 on theBenchmark for (1200ds/307Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6790)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1715691302:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_1200 on theBenchmark for (1200ds/201Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6788)dis+1002_16:1_to=lpo:sil=64000:norm_ineq=on:sas=z3:si=on:gve=force:uwa=one_side_constant:random_seed=1530425039:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_1200 on theBenchmark for (1200ds/12Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6794)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3935967625:i=33:rtra=on_1200 on theBenchmark for (1200ds/33Mi)
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6793)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3084311011:i=46:rtra=on_1200 on theBenchmark for (1200ds/46Mi)
0.20/0.44	% (6792)First to succeed.
0.20/0.44	% (6792)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6786"
0.20/0.44	% (6786)Running in auto input_syntax mode. Trying TPTP
0.20/0.44	% (6792)Refutation found. Thanks to Tanya!
0.20/0.44	% SZS status Theorem for theBenchmark
0.20/0.44	% SZS output start Proof for theBenchmark
0.20/0.44	tff(func_def_0, type, g: ($int * $int) > $int).
0.20/0.44	tff(func_def_11, type, -1: $int > $int).
0.20/0.44	tff(func_def_12, type, -2: $int > $int).
0.20/0.44	tff(func_def_13, type, 2: $int > $int).
0.20/0.44	tff(func_def_14, type, 3: $int > $int).
0.20/0.44	tff(f54,plain,(
0.20/0.44	  $false),
0.20/0.44	  inference(evaluation,[],[f52])).
0.20/0.44	tff(f52,plain,(
0.20/0.44	  4 != $sum(2,2)),
0.20/0.44	  inference(equality_resolution,[],[f38])).
0.20/0.44	tff(f38,plain,(
0.20/0.44	  ( ! [X0 : $int] : (g(3,2) != g(3,X0) | 4 != $sum(X0,2)) )),
0.20/0.44	  inference(evaluation,[],[f34])).
0.20/0.44	tff(f34,plain,(
0.20/0.44	  ( ! [X0 : $int] : (5 != $sum(3,2) | g(3,2) != g(3,X0) | 4 != $sum(X0,2)) )),
0.20/0.44	  inference(constrained_superposition,[],[f26,f23])).
0.20/0.44	tff(f23,plain,(
0.20/0.44	  ( ! [X0 : $int] : (g(3,3) = g(3,X0) | 4 != $sum(X0,2)) )),
0.20/0.44	  inference(constrained_superposition,[],[f19,f18])).
0.20/0.44	tff(f18,plain,(
0.20/0.44	  g(3,3) = g(3,4)),
0.20/0.44	  inference(cnf_transformation,[],[f17])).
0.20/0.44	tff(f17,plain,(
0.20/0.44	  g(3,2) != g(3,5) & ! [X0 : $int,X1 : $int] : g(X1,$sum(X0,2)) = g(X1,X0) & g(3,3) = g(3,4)),
0.20/0.44	  inference(rectify,[],[f16])).
0.20/0.44	tff(f16,plain,(
0.20/0.44	  g(3,2) != g(3,5) & ! [X1 : $int,X0 : $int] : g(X0,X1) = g(X0,$sum(X1,2)) & g(3,3) = g(3,4)),
0.20/0.44	  inference(flattening,[],[f15])).
0.20/0.44	tff(f15,plain,(
0.20/0.44	  (g(3,2) != g(3,5) & g(3,3) = g(3,4)) & ! [X1 : $int,X0 : $int] : g(X0,X1) = g(X0,$sum(X1,2))),
0.20/0.44	  inference(ennf_transformation,[],[f2])).
0.20/0.44	tff(f2,negated_conjecture,(
0.20/0.44	  ~(! [X1 : $int,X0 : $int] : g(X0,X1) = g(X0,$sum(X1,2)) => (g(3,3) = g(3,4) => g(3,2) = g(3,5)))),
0.20/0.44	  inference(negated_conjecture,[status(cth)],[f1])).
0.20/0.44	tff(f1,conjecture,(
0.20/0.44	  ! [X1 : $int,X0 : $int] : g(X0,X1) = g(X0,$sum(X1,2)) => (g(3,3) = g(3,4) => g(3,2) = g(3,5))),
0.20/0.44	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.20/0.44	tff(f19,plain,(
0.20/0.44	  ( ! [X0 : $int,X1 : $int] : (g(X1,$sum(X0,2)) = g(X1,X0)) )),
0.20/0.44	  inference(cnf_transformation,[],[f17])).
0.20/0.44	tff(f26,plain,(
0.20/0.44	  ( ! [X0 : $int] : (g(3,2) != g(3,X0) | 5 != $sum(X0,2)) )),
0.20/0.44	  inference(constrained_superposition,[],[f20,f19])).
0.20/0.44	tff(f20,plain,(
0.20/0.44	  g(3,2) != g(3,5)),
0.20/0.44	  inference(cnf_transformation,[],[f17])).
0.20/0.44	% SZS output end Proof for theBenchmark
0.20/0.44	% (6792)------------------------------
0.20/0.44	% (6792)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200)
0.20/0.44	% (6792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.20/0.44	% (6792)Termination reason: Refutation
0.20/0.44	
0.20/0.44	% (6792)Time elapsed: 0.003 s
0.20/0.44	% (6792)Peak memory usage: 8 MB
0.20/0.44	% (6792)Instructions burned: 3 (million)
0.20/0.44	% (6792)------------------------------
0.20/0.44	% (6792)------------------------------
0.20/0.44	% (6786)Success in time 0.081 s
0.20/0.44	EOF