TSTP Solution File: REL009+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : REL009+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n020.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 May 21 02:35:20 EDT 2024
% Result : Theorem 149.76s 21.82s
% Output : Refutation 149.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 28 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 7 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 65 ( 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f654211,plain,
$false,
inference(trivial_inequality_removal,[],[f654210]) ).
fof(f654210,plain,
composition(sK1,sK2) != composition(sK1,sK2),
inference(forward_demodulation,[],[f654206,f41]) ).
fof(f41,plain,
sK1 = join(sK1,sK0),
inference(superposition,[],[f28,f22]) ).
fof(f22,plain,
sK1 = join(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ( composition(sK2,sK1) != join(composition(sK2,sK0),composition(sK2,sK1))
| composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) )
& sK1 = join(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f19,f20]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( ( composition(X2,X1) != join(composition(X2,X0),composition(X2,X1))
| composition(X1,X2) != join(composition(X0,X2),composition(X1,X2)) )
& join(X0,X1) = X1 )
=> ( ( composition(sK2,sK1) != join(composition(sK2,sK0),composition(sK2,sK1))
| composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) )
& sK1 = join(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ( composition(X2,X1) != join(composition(X2,X0),composition(X2,X1))
| composition(X1,X2) != join(composition(X0,X2),composition(X1,X2)) )
& join(X0,X1) = X1 ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( join(X0,X1) = X1
=> ( composition(X2,X1) = join(composition(X2,X0),composition(X2,X1))
& composition(X1,X2) = join(composition(X0,X2),composition(X1,X2)) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( join(X0,X1) = X1
=> ( composition(X2,X1) = join(composition(X2,X0),composition(X2,X1))
& composition(X1,X2) = join(composition(X0,X2),composition(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f28,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
fof(f654206,plain,
composition(sK1,sK2) != composition(join(sK1,sK0),sK2),
inference(superposition,[],[f648129,f1800]) ).
fof(f1800,plain,
! [X2,X0,X1] : composition(join(X0,X2),X1) = join(composition(X2,X1),composition(X0,X1)),
inference(superposition,[],[f36,f28]) ).
fof(f36,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_distributivity) ).
fof(f648129,plain,
composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)),
inference(trivial_inequality_removal,[],[f648128]) ).
fof(f648128,plain,
( composition(sK2,sK1) != composition(sK2,sK1)
| composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) ),
inference(forward_demodulation,[],[f648126,f22]) ).
fof(f648126,plain,
( composition(sK2,sK1) != composition(sK2,join(sK0,sK1))
| composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) ),
inference(backward_demodulation,[],[f23,f648125]) ).
fof(f648125,plain,
! [X2,X0,X1] : join(composition(X1,X0),composition(X1,X2)) = composition(X1,join(X0,X2)),
inference(forward_demodulation,[],[f648124,f24]) ).
fof(f24,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f648124,plain,
! [X2,X0,X1] : composition(X1,join(X0,X2)) = join(composition(converse(converse(X1)),X0),composition(X1,X2)),
inference(forward_demodulation,[],[f648123,f24]) ).
fof(f648123,plain,
! [X2,X0,X1] : composition(X1,join(X0,X2)) = join(composition(converse(converse(X1)),X0),converse(converse(composition(X1,X2)))),
inference(forward_demodulation,[],[f648122,f24]) ).
fof(f648122,plain,
! [X2,X0,X1] : join(composition(converse(converse(X1)),X0),converse(converse(composition(X1,X2)))) = composition(X1,join(X0,converse(converse(X2)))),
inference(forward_demodulation,[],[f648121,f45]) ).
fof(f45,plain,
! [X0,X1] : converse(join(converse(X0),X1)) = join(X0,converse(X1)),
inference(superposition,[],[f29,f24]) ).
fof(f29,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).
fof(f648121,plain,
! [X2,X0,X1] : join(composition(converse(converse(X1)),X0),converse(converse(composition(X1,X2)))) = composition(X1,converse(join(converse(X0),converse(X2)))),
inference(forward_demodulation,[],[f647725,f51]) ).
fof(f51,plain,
! [X0,X1] : composition(X0,converse(X1)) = converse(composition(X1,converse(X0))),
inference(superposition,[],[f30,f24]) ).
fof(f30,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_multiplicativity) ).
fof(f647725,plain,
! [X2,X0,X1] : join(composition(converse(converse(X1)),X0),converse(converse(composition(X1,X2)))) = converse(composition(join(converse(X0),converse(X2)),converse(X1))),
inference(superposition,[],[f11784,f1798]) ).
fof(f1798,plain,
! [X2,X0,X1] : composition(join(X2,converse(X0)),converse(X1)) = join(composition(X2,converse(X1)),converse(composition(X1,X0))),
inference(superposition,[],[f36,f30]) ).
fof(f11784,plain,
! [X2,X0,X1] : converse(join(composition(converse(X0),X1),X2)) = join(composition(converse(X1),X0),converse(X2)),
inference(superposition,[],[f29,f52]) ).
fof(f52,plain,
! [X0,X1] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[],[f30,f24]) ).
fof(f23,plain,
( composition(sK2,sK1) != join(composition(sK2,sK0),composition(sK2,sK1))
| composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : REL009+2 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 08:17:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % (30446)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (30449)WARNING: value z3 for option sas not known
% 0.12/0.36 % (30453)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.12/0.36 % (30451)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.12/0.36 % (30450)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (30452)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.12/0.36 % (30448)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 % (30449)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.12/0.36 % (30447)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.37 TRYING [1]
% 0.12/0.37 TRYING [2]
% 0.12/0.38 TRYING [1]
% 0.12/0.38 TRYING [2]
% 0.12/0.39 TRYING [3]
% 0.19/0.41 TRYING [3]
% 0.19/0.45 TRYING [4]
% 0.19/0.49 TRYING [4]
% 2.68/0.73 TRYING [5]
% 7.30/1.46 TRYING [1]
% 7.30/1.47 TRYING [2]
% 7.93/1.47 TRYING [5]
% 7.93/1.48 TRYING [3]
% 8.33/1.54 TRYING [4]
% 9.50/1.78 TRYING [6]
% 11.01/1.93 TRYING [5]
% 19.33/3.17 TRYING [6]
% 36.13/5.59 TRYING [7]
% 55.49/8.36 TRYING [7]
% 128.42/18.78 TRYING [8]
% 149.22/21.75 % (30452)First to succeed.
% 149.76/21.79 % (30452)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30446"
% 149.76/21.82 % (30452)Refutation found. Thanks to Tanya!
% 149.76/21.82 % SZS status Theorem for theBenchmark
% 149.76/21.82 % SZS output start Proof for theBenchmark
% See solution above
% 149.76/21.82 % (30452)------------------------------
% 149.76/21.82 % (30452)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 149.76/21.82 % (30452)Termination reason: Refutation
% 149.76/21.82
% 149.76/21.82 % (30452)Memory used [KB]: 239039
% 149.76/21.82 % (30452)Time elapsed: 21.433 s
% 149.76/21.82 % (30452)Instructions burned: 42903 (million)
% 149.76/21.82 % (30446)Success in time 21.346 s
%------------------------------------------------------------------------------