TSTP Solution File: GRP665+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 16:23:30 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 67 ( 53 unt; 0 def)
% Number of atoms : 97 ( 96 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 68 ( 38 ~; 23 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-2 aty)
% Number of variables : 58 ( 52 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f554,plain,
$false,
inference(subsumption_resolution,[],[f553,f510]) ).
fof(f510,plain,
sF3 != sF5,
inference(trivial_inequality_removal,[],[f509]) ).
fof(f509,plain,
( sF5 != sF5
| sF3 != sF5 ),
inference(duplicate_literal_removal,[],[f508]) ).
fof(f508,plain,
( sF3 != sF5
| sF3 != sF5
| sF5 != sF5 ),
inference(superposition,[],[f127,f469]) ).
fof(f469,plain,
sF7 = sF5,
inference(forward_demodulation,[],[f468,f41]) ).
fof(f41,plain,
mult(sF4,sK0) = sF5,
introduced(function_definition,[]) ).
fof(f468,plain,
sF7 = mult(sF4,sK0),
inference(forward_demodulation,[],[f450,f43]) ).
fof(f43,plain,
sF7 = mult(op_c,sF6),
introduced(function_definition,[]) ).
fof(f450,plain,
mult(sF4,sK0) = mult(op_c,sF6),
inference(superposition,[],[f198,f42]) ).
fof(f42,plain,
sF6 = mult(sK1,sK0),
introduced(function_definition,[]) ).
fof(f198,plain,
! [X21] : mult(sF4,X21) = mult(op_c,mult(sK1,X21)),
inference(forward_demodulation,[],[f197,f92]) ).
fof(f92,plain,
! [X0] : ld(op_c,mult(X0,op_c)) = X0,
inference(superposition,[],[f36,f37]) ).
fof(f37,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1] : mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f36,plain,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f197,plain,
! [X21] : mult(sF4,ld(op_c,mult(X21,op_c))) = mult(op_c,mult(sK1,X21)),
inference(forward_demodulation,[],[f150,f37]) ).
fof(f150,plain,
! [X21] : mult(sF4,ld(op_c,mult(X21,op_c))) = mult(mult(sK1,X21),op_c),
inference(superposition,[],[f33,f40]) ).
fof(f40,plain,
mult(sK1,op_c) = sF4,
introduced(function_definition,[]) ).
fof(f33,plain,
! [X2,X0,X1] : mult(mult(X2,X0),X1) = mult(mult(X2,X1),ld(X1,mult(X0,X1))),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] : mult(mult(X2,X0),X1) = mult(mult(X2,X1),ld(X1,mult(X0,X1))),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0,X2] : mult(mult(X2,X0),ld(X0,mult(X1,X0))) = mult(mult(X2,X1),X0),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X2,X0,X1] : mult(mult(X1,X0),X2) = mult(mult(X1,X2),ld(X2,mult(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f127,plain,
( sF7 != sF5
| sF3 != sF5
| sF7 != sF3 ),
inference(backward_demodulation,[],[f115,f124]) ).
fof(f124,plain,
sF3 = sF11,
inference(forward_demodulation,[],[f123,f39]) ).
fof(f39,plain,
sF3 = mult(sK1,sF2),
introduced(function_definition,[]) ).
fof(f123,plain,
sF11 = mult(sK1,sF2),
inference(backward_demodulation,[],[f47,f117]) ).
fof(f117,plain,
sF2 = sF10,
inference(forward_demodulation,[],[f98,f38]) ).
fof(f38,plain,
sF2 = mult(op_c,sK0),
introduced(function_definition,[]) ).
fof(f98,plain,
sF10 = mult(op_c,sK0),
inference(superposition,[],[f46,f37]) ).
fof(f46,plain,
sF10 = mult(sK0,op_c),
introduced(function_definition,[]) ).
fof(f47,plain,
sF11 = mult(sK1,sF10),
introduced(function_definition,[]) ).
fof(f115,plain,
( sF3 != sF5
| sF7 != sF11
| sF7 != sF5 ),
inference(backward_demodulation,[],[f105,f113]) ).
fof(f113,plain,
sF9 = sF5,
inference(forward_demodulation,[],[f112,f41]) ).
fof(f112,plain,
mult(sF4,sK0) = sF9,
inference(backward_demodulation,[],[f45,f107]) ).
fof(f107,plain,
sF8 = sF4,
inference(backward_demodulation,[],[f44,f90]) ).
fof(f90,plain,
mult(op_c,sK1) = sF4,
inference(superposition,[],[f37,f40]) ).
fof(f44,plain,
mult(op_c,sK1) = sF8,
introduced(function_definition,[]) ).
fof(f45,plain,
mult(sF8,sK0) = sF9,
introduced(function_definition,[]) ).
fof(f105,plain,
( sF3 != sF5
| sF7 != sF9
| sF7 != sF11 ),
inference(backward_demodulation,[],[f49,f101]) ).
fof(f101,plain,
sF7 = sF12,
inference(forward_demodulation,[],[f100,f43]) ).
fof(f100,plain,
sF12 = mult(op_c,sF6),
inference(superposition,[],[f48,f37]) ).
fof(f48,plain,
sF12 = mult(sF6,op_c),
introduced(function_definition,[]) ).
fof(f49,plain,
( sF12 != sF11
| sF3 != sF5
| sF7 != sF9 ),
inference(definition_folding,[],[f29,f48,f42,f47,f46,f45,f44,f43,f42,f41,f40,f39,f38]) ).
fof(f29,plain,
( mult(sK1,mult(op_c,sK0)) != mult(mult(sK1,op_c),sK0)
| mult(op_c,mult(sK1,sK0)) != mult(mult(op_c,sK1),sK0)
| mult(sK1,mult(sK0,op_c)) != mult(mult(sK1,sK0),op_c) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( mult(sK1,mult(op_c,sK0)) != mult(mult(sK1,op_c),sK0)
| mult(op_c,mult(sK1,sK0)) != mult(mult(op_c,sK1),sK0)
| mult(sK1,mult(sK0,op_c)) != mult(mult(sK1,sK0),op_c) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f22,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( mult(mult(X1,op_c),X0) != mult(X1,mult(op_c,X0))
| mult(op_c,mult(X1,X0)) != mult(mult(op_c,X1),X0)
| mult(X1,mult(X0,op_c)) != mult(mult(X1,X0),op_c) )
=> ( mult(sK1,mult(op_c,sK0)) != mult(mult(sK1,op_c),sK0)
| mult(op_c,mult(sK1,sK0)) != mult(mult(op_c,sK1),sK0)
| mult(sK1,mult(sK0,op_c)) != mult(mult(sK1,sK0),op_c) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1] :
( mult(mult(X1,op_c),X0) != mult(X1,mult(op_c,X0))
| mult(op_c,mult(X1,X0)) != mult(mult(op_c,X1),X0)
| mult(X1,mult(X0,op_c)) != mult(mult(X1,X0),op_c) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
? [X1,X0] :
( mult(X0,mult(op_c,X1)) != mult(mult(X0,op_c),X1)
| mult(mult(op_c,X0),X1) != mult(op_c,mult(X0,X1))
| mult(X0,mult(X1,op_c)) != mult(mult(X0,X1),op_c) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X0] :
( mult(mult(op_c,X0),X1) = mult(op_c,mult(X0,X1))
& mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c)
& mult(X0,mult(op_c,X1)) = mult(mult(X0,op_c),X1) ),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X3,X4] :
( mult(mult(X3,X4),op_c) = mult(X3,mult(X4,op_c))
& mult(mult(X3,op_c),X4) = mult(X3,mult(op_c,X4))
& mult(op_c,mult(X3,X4)) = mult(mult(op_c,X3),X4) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X3,X4] :
( mult(mult(X3,X4),op_c) = mult(X3,mult(X4,op_c))
& mult(mult(X3,op_c),X4) = mult(X3,mult(op_c,X4))
& mult(op_c,mult(X3,X4)) = mult(mult(op_c,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f553,plain,
sF3 = sF5,
inference(backward_demodulation,[],[f41,f552]) ).
fof(f552,plain,
mult(sF4,sK0) = sF3,
inference(forward_demodulation,[],[f542,f39]) ).
fof(f542,plain,
mult(sF4,sK0) = mult(sK1,sF2),
inference(superposition,[],[f198,f255]) ).
fof(f255,plain,
! [X22] : mult(op_c,mult(X22,sK0)) = mult(X22,sF2),
inference(forward_demodulation,[],[f237,f96]) ).
fof(f96,plain,
! [X1] : rd(mult(op_c,X1),op_c) = X1,
inference(superposition,[],[f28,f37]) ).
fof(f28,plain,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f237,plain,
! [X22] : mult(rd(mult(op_c,X22),op_c),sF2) = mult(op_c,mult(X22,sK0)),
inference(superposition,[],[f35,f38]) ).
fof(f35,plain,
! [X2,X0,X1] : mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] : mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X2,X1,X0] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X1,mult(X0,X2)) = mult(rd(mult(X1,X0),X1),mult(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 22:55:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (6456)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.50 % (6471)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.50 TRYING [1]
% 0.19/0.50 TRYING [2]
% 0.19/0.50 % (6463)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 TRYING [3]
% 0.19/0.51 % (6467)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 % (6458)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.51 % (6469)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (6466)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (6457)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 TRYING [4]
% 0.19/0.52 % (6468)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.52 % (6463)Instruction limit reached!
% 0.19/0.52 % (6463)------------------------------
% 0.19/0.52 % (6463)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (6478)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.52 % (6484)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.52 % (6473)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.52 % (6472)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52 % (6460)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 TRYING [1]
% 0.19/0.52 TRYING [2]
% 0.19/0.53 % (6461)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.53 % (6459)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (6470)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53 % (6480)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.53 % (6481)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.53 % (6471)First to succeed.
% 0.19/0.53 % (6463)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (6463)Termination reason: Unknown
% 0.19/0.53 % (6463)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (6463)Memory used [KB]: 5500
% 0.19/0.53 % (6463)Time elapsed: 0.122 s
% 0.19/0.53 % (6463)Instructions burned: 8 (million)
% 0.19/0.53 % (6463)------------------------------
% 0.19/0.53 % (6463)------------------------------
% 0.19/0.53 % (6476)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.54 % (6483)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.54 % (6458)Also succeeded, but the first one will report.
% 0.19/0.54 % (6485)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.54 % (6471)Refutation found. Thanks to Tanya!
% 0.19/0.54 % SZS status Theorem for theBenchmark
% 0.19/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54 % (6471)------------------------------
% 0.19/0.54 % (6471)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (6471)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (6471)Termination reason: Refutation
% 0.19/0.54
% 0.19/0.54 % (6471)Memory used [KB]: 1535
% 0.19/0.54 % (6471)Time elapsed: 0.122 s
% 0.19/0.54 % (6471)Instructions burned: 28 (million)
% 0.19/0.54 % (6471)------------------------------
% 0.19/0.54 % (6471)------------------------------
% 0.19/0.54 % (6455)Success in time 0.19 s
%------------------------------------------------------------------------------