TSTP Solution File: GRP702+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP702+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 : n014.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:41 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 24 unt; 0 def)
% Number of atoms : 60 ( 59 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 56 ( 32 ~; 17 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f241,plain,
$false,
inference(trivial_inequality_removal,[],[f235]) ).
fof(f235,plain,
mult(sK0,mult(sK1,op_c)) != mult(sK0,mult(sK1,op_c)),
inference(superposition,[],[f55,f34]) ).
fof(f34,plain,
! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f55,plain,
mult(sK0,mult(sK1,op_c)) != mult(mult(sK0,sK1),op_c),
inference(forward_demodulation,[],[f54,f47]) ).
fof(f47,plain,
op_c = op_d,
inference(backward_demodulation,[],[f38,f44]) ).
fof(f44,plain,
! [X0] : ld(unit,X0) = X0,
inference(superposition,[],[f29,f26]) ).
fof(f26,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] : mult(unit,X0) = X0,
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f29,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/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f38,plain,
op_d = ld(unit,op_c),
inference(superposition,[],[f27,f25]) ).
fof(f25,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] : mult(X0,unit) = X0,
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f27,plain,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X1] : op_d = ld(X1,mult(op_c,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f54,plain,
mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d),
inference(trivial_inequality_removal,[],[f53]) ).
fof(f53,plain,
( mult(sK0,mult(op_c,sK1)) != mult(sK0,mult(op_c,sK1))
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d) ),
inference(forward_demodulation,[],[f52,f35]) ).
fof(f35,plain,
! [X0,X1] : mult(X1,mult(op_c,X0)) = mult(mult(X1,op_c),X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] : mult(X1,mult(op_c,X0)) = mult(mult(X1,op_c),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f52,plain,
( mult(sK0,mult(op_c,sK1)) != mult(mult(sK0,op_c),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d) ),
inference(forward_demodulation,[],[f51,f47]) ).
fof(f51,plain,
( mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d) ),
inference(trivial_inequality_removal,[],[f50]) ).
fof(f50,plain,
( mult(op_c,mult(sK0,sK1)) != mult(op_c,mult(sK0,sK1))
| mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d) ),
inference(forward_demodulation,[],[f49,f36]) ).
fof(f36,plain,
! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f49,plain,
( mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1)
| mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d) ),
inference(backward_demodulation,[],[f24,f47]) ).
fof(f24,plain,
( mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d)
| mult(op_d,mult(sK0,sK1)) != mult(mult(op_d,sK0),sK1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d)
| mult(op_d,mult(sK0,sK1)) != mult(mult(op_d,sK0),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f21,f22]) ).
fof(f22,plain,
( ? [X0,X1] :
( mult(X0,mult(op_d,X1)) != mult(mult(X0,op_d),X1)
| mult(X0,mult(X1,op_d)) != mult(mult(X0,X1),op_d)
| mult(op_d,mult(X0,X1)) != mult(mult(op_d,X0),X1) )
=> ( mult(sK0,mult(op_d,sK1)) != mult(mult(sK0,op_d),sK1)
| mult(sK0,mult(sK1,op_d)) != mult(mult(sK0,sK1),op_d)
| mult(op_d,mult(sK0,sK1)) != mult(mult(op_d,sK0),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( mult(X0,mult(op_d,X1)) != mult(mult(X0,op_d),X1)
| mult(X0,mult(X1,op_d)) != mult(mult(X0,X1),op_d)
| mult(op_d,mult(X0,X1)) != mult(mult(op_d,X0),X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1] :
( mult(X0,mult(op_d,X1)) = mult(mult(X0,op_d),X1)
& mult(X0,mult(X1,op_d)) = mult(mult(X0,X1),op_d)
& mult(op_d,mult(X0,X1)) = mult(mult(op_d,X0),X1) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X3,X4] :
( mult(X3,mult(op_d,X4)) = mult(mult(X3,op_d),X4)
& mult(X3,mult(X4,op_d)) = mult(mult(X3,X4),op_d)
& mult(op_d,mult(X3,X4)) = mult(mult(op_d,X3),X4) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X3,X4] :
( mult(X3,mult(op_d,X4)) = mult(mult(X3,op_d),X4)
& mult(X3,mult(X4,op_d)) = mult(mult(X3,X4),op_d)
& mult(op_d,mult(X3,X4)) = mult(mult(op_d,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP702+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 04:16:34 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (26236)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (26241)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.14/0.37 % (26240)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (26239)WARNING: value z3 for option sas not known
% 0.14/0.38 % (26242)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.14/0.38 % (26237)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (26243)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.14/0.38 % (26239)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.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (26238)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 TRYING [3]
% 0.14/0.38 % (26242)First to succeed.
% 0.14/0.38 TRYING [1]
% 0.14/0.38 % (26242)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (26242)------------------------------
% 0.14/0.38 % (26242)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38 % (26242)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (26242)Memory used [KB]: 846
% 0.14/0.38 % (26242)Time elapsed: 0.008 s
% 0.14/0.38 % (26242)Instructions burned: 14 (million)
% 0.14/0.38 % (26242)------------------------------
% 0.14/0.38 % (26242)------------------------------
% 0.14/0.38 % (26236)Success in time 0.021 s
%------------------------------------------------------------------------------