TSTP Solution File: GRP665+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 : Tue Apr 30 12:08:31 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 25 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 45 ( 25 ~; 13 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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 : 56 ( 52 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f318,plain,
$false,
inference(subsumption_resolution,[],[f317,f181]) ).
fof(f181,plain,
! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(X1,op_c),X0),
inference(forward_demodulation,[],[f180,f24]) ).
fof(f24,plain,
! [X0] : mult(X0,op_c) = mult(op_c,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : mult(X0,op_c) = mult(op_c,X0),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1] : mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
fof(f180,plain,
! [X0,X1] : mult(mult(X1,X0),op_c) = mult(mult(X1,op_c),X0),
inference(forward_demodulation,[],[f157,f25]) ).
fof(f25,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f157,plain,
! [X0,X1] : mult(mult(X1,X0),op_c) = mult(mult(X1,op_c),ld(op_c,mult(op_c,X0))),
inference(superposition,[],[f30,f24]) ).
fof(f30,plain,
! [X2,X0,X1] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(X1,X0))),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(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/sandbox2/benchmark/theBenchmark.p',f08) ).
fof(f317,plain,
mult(mult(sK0,op_c),sK1) != mult(op_c,mult(sK0,sK1)),
inference(forward_demodulation,[],[f316,f86]) ).
fof(f86,plain,
! [X0,X1] : mult(X0,mult(op_c,X1)) = mult(op_c,mult(X0,X1)),
inference(forward_demodulation,[],[f68,f26]) ).
fof(f26,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f68,plain,
! [X0,X1] : mult(X0,mult(op_c,X1)) = mult(rd(mult(op_c,X0),X0),mult(X0,X1)),
inference(superposition,[],[f29,f24]) ).
fof(f29,plain,
! [X2,X0,X1] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] : 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/sandbox2/benchmark/theBenchmark.p',f07) ).
fof(f316,plain,
mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1)),
inference(subsumption_resolution,[],[f315,f24]) ).
fof(f315,plain,
( mult(mult(sK0,sK1),op_c) != mult(op_c,mult(sK0,sK1))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1)) ),
inference(forward_demodulation,[],[f314,f86]) ).
fof(f314,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(op_c,sK1))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1)) ),
inference(forward_demodulation,[],[f313,f24]) ).
fof(f313,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1)) ),
inference(subsumption_resolution,[],[f21,f175]) ).
fof(f175,plain,
! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
inference(forward_demodulation,[],[f174,f24]) ).
fof(f174,plain,
! [X0,X1] : mult(mult(X0,X1),op_c) = mult(mult(op_c,X0),X1),
inference(forward_demodulation,[],[f148,f36]) ).
fof(f36,plain,
! [X0] : ld(op_c,mult(X0,op_c)) = X0,
inference(superposition,[],[f25,f24]) ).
fof(f148,plain,
! [X0,X1] : mult(mult(X0,X1),op_c) = mult(mult(op_c,X0),ld(op_c,mult(X1,op_c))),
inference(superposition,[],[f30,f24]) ).
fof(f21,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( mult(mult(X0,X1),op_c) != mult(X0,mult(X1,op_c))
| mult(mult(X0,op_c),X1) != mult(X0,mult(op_c,X1))
| mult(op_c,mult(X0,X1)) != mult(mult(op_c,X0),X1) )
=> ( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] :
( mult(mult(X0,X1),op_c) != mult(X0,mult(X1,op_c))
| mult(mult(X0,op_c),X1) != mult(X0,mult(op_c,X1))
| mult(op_c,mult(X0,X1)) != mult(mult(op_c,X0),X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
~ ! [X0,X1] :
( mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c))
& mult(mult(X0,op_c),X1) = mult(X0,mult(op_c,X1))
& mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),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/sandbox2/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n016.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 : Tue Apr 30 05:05:56 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (25908)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.36 % (25911)WARNING: value z3 for option sas not known
% 0.20/0.36 % (25912)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.36 % (25914)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.20/0.36 % (25913)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.20/0.36 % (25910)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.36 % (25911)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.36 % (25915)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.20/0.36 % (25909)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.36 TRYING [1]
% 0.20/0.36 TRYING [2]
% 0.20/0.37 TRYING [3]
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.37 % (25911)First to succeed.
% 0.20/0.37 TRYING [4]
% 0.20/0.38 % (25911)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (25911)------------------------------
% 0.20/0.38 % (25911)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.38 % (25911)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (25911)Memory used [KB]: 860
% 0.20/0.38 % (25911)Time elapsed: 0.013 s
% 0.20/0.38 % (25911)Instructions burned: 19 (million)
% 0.20/0.38 % (25911)------------------------------
% 0.20/0.38 % (25911)------------------------------
% 0.20/0.38 % (25908)Success in time 0.027 s
%------------------------------------------------------------------------------